Timeline for Counting the number of orbits finite groups of "diagonal type"
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 17, 2017 at 15:36 | history | edited | Nick Gill |
Added group theory tag
|
|
| Jan 16, 2017 at 13:41 | history | edited | Jairo Bochi | CC BY-SA 3.0 |
added 178 characters in body
|
| Jan 13, 2017 at 19:36 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 38 characters in body
|
| Jan 13, 2017 at 16:59 | comment | added | Jairo Bochi | @MarkWildon corrected the typos, thanks. | |
| Jan 13, 2017 at 16:36 | history | edited | Jairo Bochi | CC BY-SA 3.0 |
Corrected 2 typos
|
| Jan 13, 2017 at 16:29 | comment | added | Mark Wildon | Let $G^{(i)}$ be the subgroup of $S_{r_i}$ generated by the permutations $g^{(i)}_j$ for $j = 1,\ldots,n$. By the orbit-counting lemma, the number of orbits of $G$ is at most $|G^{(1)}| \ldots |G^{(k)}| / |G|$. This generalizes your upper bound for the $1$-generator case. (Two typos: $g_j$ has $k$ components, not $n$; I think $f_j^{(1)}$ should be $g_j$ below the question.) | |
| Jan 13, 2017 at 15:08 | history | asked | Jairo Bochi | CC BY-SA 3.0 |