| order | 4080 |
| automorphism | Aut(G) order 1044480 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D2040 |
| Fitting | C3×C5×C8×C17 ⋊ C2 |
| Hall | C3×C5×C17 ⋊ D8 |
| Hall | C5×C17 ⋊ D24 |
| Hall | C3×C17 ⋊ D40 |
| Sylow | C17 ⋊ D120 |
| Hall | C3×C5 ⋊ D136 |
| Sylow | C5 ⋊ D408 |
| Sylow | C3 ⋊ D680 |
88 conjugacy classes of subgroups.
| minimal degree | μ(G) = 33 |
| transitive degree | μt(G) = 2040 |
A minimal faithful permutation representation — 2 generators on 33 points:
(1,2,3,4,5,6,7,8)(9,10,11)(12,13,14,15,16)(17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33);(2,8)(3,7)(4,6)(10,11)(13,16)(14,15)(18,33)(19,32)(20,31)(21,30)(22,29)(23,28)(24,27)(25,26)Polycyclic presentation:
2^4,3,5,17|b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^2,f^a=f^4,g^a=g^161023 conjugacy classes — view the full character table.
| maximal subgroup of | D4080, D6120, D10200, … |
| maximal normal subgroup of | D4080 |
| maximal quotient of | D4080, D6120, Dic2040, … |
Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:
gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f", "g");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 5, 17]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> SetConjugate(coll, 6, 1, F.6^4);;
gap> SetConjugate(coll, 7, 1, F.7^16);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);