| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C4 | #13673 |
| commutator, Frattini, cosocle | #493 | C24 |
| socle | C2 | C2×#13673 |
| LCS | G ▷ #493 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C4 ◁ C2×C4 ◁ C22×C4 ◁ C2×C42 ◁ #3147 ◁ G | |
| LECS | G ▷ #493 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1457 conjugacy classes of subgroups; only the 115 normal subgroups are shown.
This group has 1457 conjugacy classes of subgroups — too many to draw. Only its 115 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 — 4 generators on 32 points:
(1,2,7,11,6,4,17,10)(3,12,16,31)(5,20,23,9,21,27,25,19)(8,26,18,22)(13,29,24,30)(14,32,28,15);(2,4)(3,13)(5,21)(10,11)(12,30)(14,28)(16,24)(22,26)(23,25)(29,31);(1,3,5,22,17,13,25,15,6,16,21,26,7,24,23,32)(2,8,27,31,10,28,9,29,4,18,20,12,11,14,19,30);(1,4,6,2)(3,14,16,28)(5,9,21,19)(7,11,17,10)(8,13,18,24)(12,26,31,22)(15,29,32,30)(20,25,27,23)Polycyclic presentation:
2^10|a^2=ghij,c^2=efhij,d^2=j,g^2=i,h^2=j,b^a=bj,c^a=ce,c^b=cf,d^a=dhij,d^b=dgi,d^c=dgi,e^a=ehj,e^b=eg,e^c=egi,e^d=ej,f^a=fghij,f^c=fgi,f^d=fhi,f^e=fhij,g^a=gi,g^b=gi,g^c=gh,g^d=gi,g^e=gi,g^f=gi,h^a=hi,h^b=hi,h^c=hj,h^d=hj,h^e=hj,h^f=hj,i^c=ij58 conjugacy classes — view the full character table.
| maximal subgroup of | #72283779, #72283911, #72338309, … |
| maximal normal subgroup of | #72283779, #72283911, #72338309, … |
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.7*F.8*F.9*F.10);;
gap> SetPower(coll, 3, F.5*F.6*F.8*F.9*F.10);;
gap> SetPower(coll, 4, 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.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.9*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, 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, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);