Timeline for Distinguishing finite-orbit permutation groups by action on tuples
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2011 at 11:11 | vote | accept | Colin Reid | ||
| Sep 4, 2010 at 8:40 | comment | added | Colin Reid | In fact, it looks like $g$ is conjugate to $g^2$ in this case. I can see now there is a lot of potential for examples of this kind. As you say though, this trick appears to require infinitely many orbits of a given size. | |
| Sep 4, 2010 at 8:10 | history | edited | Jim Belk | CC BY-SA 2.5 |
added 2 characters in body
|
| Sep 4, 2010 at 8:03 | history | answered | Jim Belk | CC BY-SA 2.5 |