Timeline for Roots of permutations
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 12, 2019 at 14:08 | history | edited | Alex B. | CC BY-SA 4.0 |
Fixed punctuation, also made several other minor improvements
|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Oct 19, 2010 at 5:35 | history | edited | Alex B. | CC BY-SA 2.5 |
Link to the follow-up questions
|
| Oct 13, 2010 at 16:48 | comment | added | Pete L. Clark | @Alex: Your Edit 2 seems very interesting. I doubt it is getting optimal exposure here: please consider asking it as as a separate question. | |
| Oct 13, 2010 at 6:54 | history | edited | Alex B. | CC BY-SA 2.5 |
Included a remark on when the generalisation breaks down
|
| Oct 11, 2010 at 15:56 | history | edited | Alex B. | CC BY-SA 2.5 |
Supplying a proof of the identity for the number of square roots; added 18 characters in body
|
| Oct 11, 2010 at 15:26 | comment | added | Richard Stanley | See also Exercise 7.69 of my book Enumerative Combinatorics, vol. 2. In particular, part (c) asserts that if $k$ is a positive integer and $r_k(w)$ is the number of $k$th roots of $w\in S_n$, then $r_k$ is a character of $S_n$. It follows that $r_k$ takes its maximum value at the identity permutation. | |
| Oct 11, 2010 at 14:55 | comment | added | Pete L. Clark | Wow, neat: I didn't see that coming at all. Do you have a reference for your identity? | |
| Oct 11, 2010 at 14:37 | vote | accept | Fedor Petrov | ||
| Oct 11, 2010 at 14:35 | history | edited | Alex B. | CC BY-SA 2.5 |
deleted 375 characters in body
|
| Oct 11, 2010 at 14:22 | history | answered | Alex B. | CC BY-SA 2.5 |