| order | 2400 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C3 · Schur multiplier (H2) = C24×C5 |
No aliases for this group.
| Fitting, socle, derived | C24×C52 ⋊ C2×C3 |
| Hall | C24×C5⋊D5 ⋊ C3 |
| Sylow | C52 ⋊ C2×C22⋊A4 |
| subgroup | G/H | |
|---|---|---|
| center, Frattini, hypercenter | C1 | G |
| commutator, Fitting, socle, cosocle, hypocenter | C24×C52 | C2×C3 |
| LCS | G ▷ C24×C52 | |
| UCS | C1 | |
1044 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 60 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2,4)(3,13,14,6,7,9)(5,10,15,11,12,8)(17,19,18)(21,23,22);(1,3,8,15,6)(4,9,12,10,14)(20,23)(21,22);(16,19)(17,18)Polycyclic presentation:
2,3,2^4,5^2|c^b=d,d^b=cd,e^b=f,f^b=ef,g^a=g^4,g^b=g^4h^2,h^a=h^4,h^b=g^280 conjugacy classes — view the full character table.
| maximal subgroup of | #72227908, #72227911, #72227915 |
| maximal normal subgroup of | #72227911 |
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, 3, 2, 2, 2, 2, 5, 5]);;
gap> SetConjugate(coll, 3, 2, F.4);;
gap> SetConjugate(coll, 4, 2, F.3*F.4);;
gap> SetConjugate(coll, 5, 2, F.6);;
gap> SetConjugate(coll, 6, 2, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^4);;
gap> SetConjugate(coll, 7, 2, F.7^4*F.8^2);;
gap> SetConjugate(coll, 8, 1, F.8^4);;
gap> SetConjugate(coll, 8, 2, F.7^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);