| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #13346 |
| commutator, Frattini, cosocle | C2×#532 | C23 |
| prime radical | C2×#3018 | C22 |
| LCS | G ▷ C2×#532 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C23×C4 ◁ C2×#532 ◁ G | |
| LECS | G ▷ C2×#532 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
1513 conjugacy classes of subgroups; only the 63 normal subgroups are shown.
This group has 1513 conjugacy classes of subgroups — too many to draw. Only its 63 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 3 generators on 24 points:
(1,2)(3,7,8,5)(4,6)(9,10,14,18,15,20,21,19)(11,12,22,13,16,23,24,17);(1,3,4,8)(2,5,6,7)(10,16)(11,20)(12,23)(13,17)(18,24)(19,22);(5,7)(9,11,21,22,15,16,14,24)(10,17,19,12,20,13,18,23)Polycyclic presentation:
2^10|a^2=f,b^2=hj,c^2=ghi,d^2=j,e^2=j,f^2=j,g^2=j,b^a=be,c^a=cf,c^b=cd,d^a=dg,d^b=dj,d^c=dij,e^a=eh,e^b=ej,e^c=eghi,e^d=eij,f^b=fhj,f^c=fj,g^a=gj,g^b=gi,g^c=gj,g^d=gj,g^e=gj,i^a=ij,i^c=ij52 conjugacy classes — view the full character table.
| maximal subgroup of | #72228015 |
| maximal normal subgroup of | #72228015 |
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.6);;
gap> SetPower(coll, 2, F.8*F.10);;
gap> SetPower(coll, 3, F.7*F.8*F.9);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
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.7*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);