Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #152018 |
| commutator | C2×#127 | C22×C4 |
| Frattini, cosocle | #3151 | C23 |
| prime radical | #6349101 | C2 |
| LCS | G ▷ C2×#127 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C22×C4 ◁ C22×C42 ◁ #60801 ◁ G | |
| LECS | G ▷ #3151 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1729 conjugacy classes of subgroups; only the 81 normal subgroups are shown.
This group has 1729 conjugacy classes of subgroups — too many to draw. Only its 81 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,12)(4,17)(5,9)(6,11)(7,10)(8,14)(13,22)(15,23)(16,24)(18,27)(19,25)(20,26)(21,30)(28,31)(29,32);(1,3,5,13,6,16,19,28,7,14,4,18,20,15,21,29)(2,8,9,22,11,23,25,31,10,12,17,27,26,24,30,32);(1,4,6,21,7,5,20,19)(2,9,11,25,10,17,26,30)(3,13)(8,22)(12,27)(14,18)(15,28)(16,29)(23,32)(24,31)Polycyclic presentation:
2^10|b^2=f,c^2=gh,f^2=hi,g^2=i,h^2=j,b^a=bd,c^a=cj,c^b=ce,d^b=di,d^c=dj,e^a=ej,e^b=eg,e^c=eh,f^a=fi,f^c=fgi,f^d=fj,f^e=fhij,g^b=gh,g^c=gi,g^e=gi,h^b=hj,h^c=hi,h^e=hj,i^b=ij43 conjugacy classes — view the full character table.
| maximal subgroup of | #72306628, #72306732, #72306923, … |
| maximal normal subgroup of | #72306628, #72306732, #72306923, … |
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.6);;
gap> SetPower(coll, 3, F.7*F.8);;
gap> SetPower(coll, 6, F.8*F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);