Timeline for What is the length of the shortest law of $S_n$?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2020 at 19:05 | comment | added | Ori Gurel-Gurevich | Apparently, the upper bound has been significantly improved by Kozma and Thom to $\exp(C \log^4n \log \log n)$. See arxiv.org/abs/1403.2324 . | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 14, 2013 at 10:11 | vote | accept | Sean Eberhard | ||
| Apr 10, 2013 at 13:17 | answer | added | Khalid Bou-Rabee | timeline score: 15 | |
| Apr 10, 2013 at 11:37 | comment | added | Alexey Kvashchuk | $F_2$ is a free group in $x$ and $y$. Sean is asking about the shortest identity $w(x,y)$ such that $w(a, b)=1$ for any $a,b\in S_n$. | |
| Apr 10, 2013 at 11:23 | comment | added | Christian Stump | Would it be possible to be a little more explicit? What is $S_n$? The symmetric group? What is $F_2$, and what is $w$ or $\mathcal{l}(w)$? | |
| Apr 10, 2013 at 11:14 | history | asked | Sean Eberhard | CC BY-SA 3.0 |