| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #11022 |
| commutator | C23×C8 | C22×C4 |
| Frattini, cosocle | C24×C8 | C23 |
| prime radical | #7623305 | C2 |
| LCS | G ▷ C23×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24×C4 ◁ C2×#1752 ◁ G | |
| LECS | G ▷ C24×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
2000 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 3 generators on 24 points:
(1,2)(3,5)(4,6)(7,8)(10,14)(11,18)(13,21)(15,17)(16,24)(19,23)(20,22);(1,3,4,7)(2,5,6,8)(9,10,12,16)(11,19,22,15)(13,23,21,17)(14,20,24,18);(5,8)(10,15,16,19)(11,20)(13,21)(14,17,24,23)(18,22)Polycyclic presentation:
2^10|b^2=hj,c^2=d,e^2=ij,i^2=j,b^a=be,c^a=cg,c^b=cef,d^b=dj,e^a=ei,e^b=ei,e^c=eij,f^a=fh,g^b=gh,i^a=ij,i^b=ij,i^c=ij82 conjugacy classes — view the full character table.
| maximal subgroup of | #72280299, #72280486 |
| maximal normal subgroup of | #72280299, #72280486 |
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, 2, F.8*F.10);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.9*F.10);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);