| order | 5040 |
| automorphism | Aut(G) order 1451520 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D2520 |
| Fitting | C5×C7×C8×C9 ⋊ C2 |
| Hall | C5×C7×C9 ⋊ D8 |
| Hall | C7×C9 ⋊ D40 |
| Hall | C5×C9 ⋊ D56 |
| Hall | C5×C7 ⋊ D72 |
| Sylow | C9 ⋊ D280 |
| Sylow | C7 ⋊ D360 |
| Sylow | C5 ⋊ D504 |
132 conjugacy classes of subgroups.
| minimal degree | μ(G) = 29 |
| transitive degree | μt(G) = 2520 |
A minimal faithful permutation representation — 2 generators on 29 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);(2,8)(3,7)(4,6)(10,17)(11,16)(12,15)(13,14)(19,22)(20,21)(24,29)(25,28)(26,27)Polycyclic presentation:
2^4,3,5,7,3|b^2=cd,c^2=d,e^3=h,b^a=bc,c^a=cd,e^a=e^2h^2,f^a=f^4,g^a=g^6,h^a=h^21263 conjugacy classes. The character table is too large to display.
| maximal subgroup of | D5040, D7560, D12600, … |
| maximal normal subgroup of | D5040 |
| maximal quotient of | D5040, Dic2520, D7560, … |
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", "h");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 5, 7, 3]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.8);;
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*F.8^2);;
gap> SetConjugate(coll, 6, 1, F.6^4);;
gap> SetConjugate(coll, 7, 1, F.7^6);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);