Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C22×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #139773 |
| commutator | C2×#124 | C22×C4 |
| Frattini, cosocle | C2×#535 | C23 |
| prime radical | #499839 | C2 |
| LCS | G ▷ C2×#124 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C23×C4 ◁ C2×#535 ◁ G | |
| LECS | G ▷ C2×#535 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
1570 conjugacy classes of subgroups; only the 73 normal subgroups are shown.
This group has 1570 conjugacy classes of subgroups — too many to draw. Only its 73 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,7,12)(3,13,16,8)(4,17,18,26)(5,11,6,10)(9,19,25,20)(14,28,30,31)(15,24,21,23)(22,29,27,32);(3,14)(4,18)(8,22)(10,11)(13,27)(15,29)(16,30)(17,26)(19,20)(21,32)(23,31)(24,28);(1,3,5,15,7,16,6,21)(2,8,10,24,12,13,11,23)(4,14,19,32,18,30,20,29)(9,22,26,28,25,27,17,31)Polycyclic presentation:
2^10|a^2=j,c^2=ef,d^2=ij,g^2=j,h^2=j,b^a=be,c^a=cgh,c^b=cd,d^a=dg,d^b=dij,d^c=dghj,e^c=egij,e^d=ei,f^a=fj,f^b=fghi,f^c=fgij,f^d=fij,f^e=fj,g^a=gj,g^b=gi,g^e=gj,g^f=gj,h^a=hj,h^b=hi,h^c=hj,h^e=hj,h^f=hj,i^a=ij49 conjugacy classes — view the full character table.
| maximal subgroup of | #72251816, #72251820, #72251824, … |
| maximal normal subgroup of | #72251816, #72251820, #72251824, … |
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.10);;
gap> SetPower(coll, 3, F.5*F.6);;
gap> SetPower(coll, 4, F.9*F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.8);;
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.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*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, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);