| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C23×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #147507 |
| commutator | C2×C42 | C2×C42 |
| Frattini, cosocle | C22×#127 | C23 |
| prime radical | C2×#3151 | C22 |
| LCS | G ▷ C2×C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C24 ◁ C2×#117 ◁ #34210 ◁ G | |
| LECS | G ▷ C22×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1639 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,7,13,21)(4,16,17,8)(5,11)(6,9,19,10)(12,26,27,32)(14,22,15,23)(18,25)(20,28,31,29)(24,30);(1,3,6,13)(2,7)(4,12,18,28)(5,15,19,14)(8,20)(9,21,10,22)(11,23)(16,26)(17,29,30,27)(24,32,25,31);(1,4)(2,8,11,16)(3,12)(5,17)(6,18)(7,20,23,26)(9,24,10,25)(13,28)(14,27)(15,29)(19,30)(21,32,22,31)Polycyclic presentation:
2^10|a^2=d,b^2=g,c^2=efgh,f^2=i,h^2=j,b^a=bf,c^a=cde,d^b=dh,d^c=dj,e^a=ej,e^b=eh,f^a=fhij,f^b=fhij,f^d=fi,f^e=fi,g^a=ghj,g^d=gij,g^e=gij,g^f=gi,h^a=hi,h^b=hi,h^d=hj,h^e=hj,h^g=hj,i^a=ij,i^b=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72319428, #72319495, #72319539, … |
| maximal normal subgroup of | #72319428, #72319495, #72319539, … |
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.4);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 3, F.5*F.6*F.7*F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
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.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9*F.10);;
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, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);