| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #23900 |
| commutator, Frattini, cosocle | C22×C22⋊C4 | C24 |
| LCS | G ▷ C22×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#120 ◁ G | |
| LECS | G ▷ C22×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
4461 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 24 points:
(9,10)(11,17,19,14)(12,20)(13,16)(15,21)(18,24,22,23);(2,5,6,7)(11,18)(12,21)(14,23)(15,20)(17,24)(19,22);(1,2)(3,7)(4,6)(5,8)(9,11)(10,14)(12,22)(13,19)(15,24)(16,17)(18,21)(20,23);(2,6)(3,8)Polycyclic presentation:
2^10|a^2=hj,b^2=g,e^2=i,c^a=cf,c^b=ce,d^b=dg,d^c=dij,e^a=eh,e^b=ej,e^c=ei,e^d=eij,f^a=fj,f^b=fhj,f^e=fj,g^c=gij,h^c=hj64 conjugacy classes — view the full character table.
| maximal subgroup of | #72233252, #72233477, #72233794, … |
| maximal normal subgroup of | #72233252, #72233477, #72233794, … |
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.8*F.10);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);