| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#2021 |
| commutator, Frattini, cosocle | C23×D4 | C24 |
| prime radical | #6437445 | C2 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ C24×D4 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
5499 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 24 points:
(1,2)(3,7,8,5)(4,6)(12,20)(16,23);(5,7)(9,10)(11,17,19,24)(12,16)(13,15)(14,18,22,21)(20,23);(1,3)(2,5)(4,8)(6,7)(9,11)(10,14)(12,21)(13,19)(15,22)(16,24)(17,23)(18,20);(2,6)(5,7)(10,15)(14,22)(16,23)(17,24)Polycyclic presentation:
2^10|a^2=g,b^2=hij,e^2=j,b^a=bg,c^a=cf,c^b=ce,d^a=di,d^b=dj,e^a=eh,e^c=ej,f^a=fi,f^b=fhij,f^e=fj,g^c=gi,h^c=hj70 conjugacy classes — view the full character table.
| maximal subgroup of | #72250105, #72250128, #72256719, … |
| maximal normal subgroup of | #72250105, #72250128, #72256719, … |
| maximal quotient of | #72250232 |
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", "i", "j");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 1, F.7);;
gap> SetPower(coll, 2, F.8*F.9*F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);