Timeline for Is there any algorithm to find the minimal generating set for $A_{n}$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Nov 13, 2016 at 13:01 | answer | added | Denis T | timeline score: 3 | |
| Nov 13, 2016 at 11:56 | history | edited | Gerry Myerson |
edited tags
|
|
| Nov 13, 2016 at 11:27 | comment | added | Derek Holt | $A_n$ is not $(2,3)$-generated for $n=6,7$ and $8$. If I wanted to do this I would just choose random elements of order $2$ and $3$ having minimal numbers of fixed points. You will find generators very quickly that way. | |
| Nov 13, 2016 at 10:38 | history | asked | Tensor_Product | CC BY-SA 3.0 |