Timeline for a simple combinatorial problems
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2011 at 16:02 | comment | added | Tara Brough | I am really puzzled about why this question has so many votes. There is no motivation given, or anything to indicate that it's not just a homework question. | |
| May 11, 2011 at 14:02 | comment | added | Igor Rivin | agree with @Doug | |
| May 11, 2011 at 12:19 | comment | added | Pietro Majer | On a side note: when posting a question, please use a more meaningful title. Just a few words that briefly tell the subject of the question. | |
| May 11, 2011 at 11:42 | comment | added | Douglas Zare | I voted to close as off-topic since I think this is a standard exercise in an undergraduate combinatorics or group theory class. | |
| May 11, 2011 at 11:40 | comment | added | Philipp Lampe | Compare mathoverflow.net/questions/2888/… | |
| May 11, 2011 at 10:48 | comment | added | Amritanshu Prasad | Alternatively, you want to know the largest conjugacy class in $\mathfrak S_n$. | |
| May 11, 2011 at 10:40 | answer | added | Fedor Petrov | timeline score: 12 | |
| May 11, 2011 at 10:09 | history | edited | Seva |
edited tags
|
|
| May 11, 2011 at 9:13 | comment | added | Stefan Geschke | Just to clarify, you want to maximize the number of permutations of a given cycle structure? | |
| May 11, 2011 at 9:06 | history | asked | X--- | CC BY-SA 3.0 |