Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C23×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #13041 |
| commutator | C2×#124 | C22×C4 |
| Frattini, cosocle | C2×#532 | C23 |
| prime radical | #499868 | C2 |
| LCS | G ▷ C2×#124 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C23×C4 ◁ C2×#532 ◁ G | |
| LECS | G ▷ C2×#532 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
1492 conjugacy classes of subgroups; only the 75 normal subgroups are shown.
This group has 1492 conjugacy classes of subgroups — too many to draw. Only its 75 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,5,7,8)(4,6)(9,10,13,18,15,16,24,19)(11,14,21,23,22,12,17,20);(1,3)(2,5,6,8)(4,7)(9,11,20,16,15,22,23,10)(12,19,13,17,14,18,24,21);(1,2)(3,5,7,8)(4,6)(9,12,13,20,15,14,24,23)(10,11,18,21,16,22,19,17)Polycyclic presentation:
2^10|a^2=f,b^2=efij,c^2=f,d^2=ij,f^2=j,g^2=j,b^a=be,c^a=cghij,c^b=cd,d^a=dg,d^b=dgi,d^c=dh,e^a=ehij,e^b=ehi,e^c=eg,e^d=ei,f^b=fhij,g^a=gj,g^b=gi,g^c=gj,g^e=gj,h^a=hj,h^b=hj,i^a=ij,i^b=ij55 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.5*F.6*F.9*F.10);;
gap> SetPower(coll, 3, F.6);;
gap> SetPower(coll, 4, F.9*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.7*F.8*F.9*F.10);;
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.7*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9*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, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);