Timeline for How to deconstruct a sum of intersecting upsets
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2012 at 6:13 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
| Aug 23, 2012 at 15:02 | comment | added | Gerhard Paseman | Not easily. The first idea that comes to mind is to take each U given by your first algorithm and break it into pieces, and then reassemble all the pieces until you get the desired collection. The second idea is to consider (assuming integral combinations) nonintersecting sets A B that are in the union and considering inequality relationships. If you get a nice collection of minimal sets in sufficient numbers,, you can generate principal intersecting upsets and see how that union compares to what you have. Gerhard "Ask Me About System Design" Paseman, 2012.08.23 | |
| Aug 23, 2012 at 14:37 | history | asked | Sean Eberhard | CC BY-SA 3.0 |