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 | #152017 |
| commutator | #532 | C22×C4 |
| Frattini, cosocle | #3151 | C23 |
| prime radical | #6349118 | C2 |
| LCS | G ▷ #532 ▷ 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 | |
1525 conjugacy classes of subgroups; only the 81 normal subgroups are shown.
This group has 1525 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,14)(4,16)(5,21)(6,12)(7,13)(8,9)(10,18)(11,23)(15,25)(17,26)(19,31)(20,30)(22,28)(24,27)(29,32);(1,3,7,8)(2,9,13,14)(4,17)(5,22,23,6)(10,26)(11,28,21,12)(15,24)(16,29)(18,32)(19,20)(25,31)(27,30);(1,4,3,15)(2,10,9,25)(5,17,23,32)(6,24)(7,18,8,20)(11,29)(12,27,28,31)(13,16,14,30)(19,22)(21,26)Polycyclic presentation:
2^10|b^2=ij,c^2=efhi,f^2=hij,g^2=i,h^2=j,b^a=bj,c^a=cd,c^b=ce,d^b=di,d^c=dj,e^a=eij,e^b=ej,e^c=eg,e^d=ej,f^a=fi,f^b=fgj,f^c=fg,f^d=fj,f^e=fhi,g^b=gi,g^c=gh,g^e=gi,h^b=hi,h^c=hij,h^e=hj,i^c=ij43 conjugacy classes — view the full character table.
| maximal subgroup of | #72306628, #72306636, #72306741, … |
| maximal normal subgroup of | #72306628, #72306636, #72306741, … |
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.9*F.10);;
gap> SetPower(coll, 3, F.5*F.6*F.8*F.9);;
gap> SetPower(coll, 6, F.8*F.9*F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
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.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.7);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.8*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);