Timeline for Partitions and finite sets
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 28, 2016 at 11:04 | history | suggested | Jeroen Zuiddam | CC BY-SA 3.0 |
Tex fixes.
|
| Jul 28, 2016 at 10:28 | review | Suggested edits | |||
| S Jul 28, 2016 at 11:04 | |||||
| Dec 7, 2011 at 11:49 | vote | accept | Taladris | ||
| Dec 5, 2011 at 7:20 | answer | added | Aaron Meyerowitz | timeline score: 3 | |
| Dec 5, 2011 at 3:22 | answer | added | Boris Novikov | timeline score: 3 | |
| Dec 5, 2011 at 2:13 | comment | added | Gerhard Paseman | In general it is a hard problem. For many instances of a product partition, the number of classes as well as many of the sizes of classes are composite. If you have a class with a prime number of elements (or just one) there aren't many ways that it can appear as part of a product partition. Cataloguing the classes by the factorizations of their sizes is a good start to finding a product if one exists. Gerhard "Ask Me About System Design" Paseman, 2011.12.04 | |
| Dec 5, 2011 at 1:47 | history | asked | Taladris | CC BY-SA 3.0 |