Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #12687 |
| commutator | C22×#41 | C22×C4 |
| Frattini, cosocle | C2×#532 | C23 |
| prime radical | #6628876 | C2 |
| LCS | G ▷ C22×#41 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C22×#41 ◁ #35513 ◁ G | |
| LECS | G ▷ C2×#532 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
8820 conjugacy classes of subgroups; only the 105 normal subgroups are shown.
This group has 8820 conjugacy classes of subgroups — too many to draw. Only its 105 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)(4,6)(5,8)(10,11)(12,22)(14,16)(23,24);(1,3)(2,5,6,7)(4,8)(9,10,13,17,15,11,19,20)(12,23,14,18,22,24,16,21);(2,6)(5,7)(9,11,14,21,15,10,16,18)(12,20,19,24,22,17,13,23)Polycyclic presentation:
2^10|b^2=e,c^2=g,e^2=j,g^2=j,b^a=bf,c^a=ch,c^b=cd,d^a=dj,d^b=dg,d^c=di,e^a=eh,e^c=egj,e^d=eij,f^b=fh,f^c=fj,f^d=fj,f^e=fj,g^a=gj,g^b=gi,g^d=gj,g^e=gj,h^b=hj,h^c=hj,i^b=ij,i^c=ij64 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, 2, F.5);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, 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, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*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);