| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C23×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #21690 |
| commutator | C4×C8 | C23×C4 |
| Frattini, cosocle | C2×C4×C8 | C24 |
| prime radical | #491519 | C2 |
| LCS | G ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C2×C42 ◁ C8×#97 ◁ G | |
| LECS | G ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
1289 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 4 generators on 24 points:
(2,5)(3,6)(7,8)(10,14,15,20)(11,18)(12,19)(16,21,23,22)(17,24);(1,2,6,8,4,7,3,5)(10,15)(14,20)(16,23)(21,22);(10,16,15,23)(11,17)(14,21,20,22)(18,24);(2,7)(5,8)(9,10,17,20,12,16,24,21,13,15,11,14,19,23,18,22)Polycyclic presentation:
2^10|a^2=e,b^2=fh,c^2=e,d^2=gj,f^2=h,g^2=i,i^2=j,b^a=bf,d^a=dg,d^b=dhj,d^c=di,e^d=ej,f^a=fh,g^a=gi,g^c=gj,i^a=ij88 conjugacy classes — view the full character table.
| maximal subgroup of | #72309590, #72309999, #72342508, … |
| maximal normal subgroup of | #72309590, #72309999, #72342508, … |
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.5);;
gap> SetPower(coll, 2, F.6*F.8);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 4, F.7*F.10);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);