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 | #532 | C22×C4 |
| Frattini, cosocle | #3151 | C23 |
| prime radical | #6350079 | C2 |
| LCS | G ▷ #532 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C22×C4 ◁ C4×#41 ◁ #60817 ◁ G | |
| LECS | G ▷ #3151 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1764 conjugacy classes of subgroups; only the 81 normal subgroups are shown.
This group has 1764 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,8)(5,10)(6,11)(7,15)(9,18)(13,29)(14,22)(16,25)(17,24)(19,28)(20,26)(21,27)(23,32)(30,31);(3,13)(7,22)(12,29)(14,15)(16,31)(17,32)(23,24)(25,30);(1,3,4,14,18,16,19,32,6,17,21,31,5,15,20,13)(2,7,8,23,9,12,28,30,11,25,27,29,10,24,26,22)Polycyclic presentation:
2^10|c^2=d,d^2=hij,f^2=j,g^2=i,h^2=j,c^a=cf,c^b=ce,d^a=di,d^b=dg,e^c=egi,e^d=ehij,f^a=fj,f^c=fij,f^d=fj,g^b=gi,g^c=gh,g^e=gi,h^b=hi,h^c=hj,h^e=hj,i^c=ij46 conjugacy classes — view the full character table.
| maximal subgroup of | #72339829, #72339877, #72339883, … |
| maximal normal subgroup of | #72339829, #72339877, #72339883, … |
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, 3, F.4);;
gap> SetPower(coll, 4, F.8*F.9*F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
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.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);