Timeline for Combinatorial Techniques for Counting Conjugacy Classes
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 16, 2009 at 20:49 | vote | accept | Nick Salter | ||
| Dec 10, 2009 at 15:18 | comment | added | Greg Kuperberg | Right. We can say that the conjugacy classes in the wreath product of $S_n$ and $G$ are cycle types in $S_n$ with each cycle decorated by a conjugacy class of $G$. The decoration is the holonomy of the cycle. The corner group of the Rubik's cube is a fun example of this principle. | |
| Dec 10, 2009 at 9:21 | comment | added | Vladimir Dotsenko | A very obvious addition to what you said about B_n - in general, if you have a combinatorial description of conjugacy class in G, classes of the semidirect product of S_n and G^n have a closely related description as well, and that shows up in various situations. | |
| Dec 10, 2009 at 3:31 | history | edited | Greg Kuperberg | CC BY-SA 2.5 |
Slight correction
|
| Dec 10, 2009 at 3:00 | history | answered | Greg Kuperberg | CC BY-SA 2.5 |