| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#2021 |
| commutator, Frattini, cosocle | C23×D4 | C24 |
| prime radical | #6470019 | C2 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ C24×D4 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
4637 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 32 points:
(3,9)(6,14)(10,12)(15,16)(17,18)(19,25)(20,28)(21,22)(23,27)(24,30)(26,32)(29,31);(1,2,5,8)(3,6,9,14)(4,11,13,7)(10,15,12,16)(17,19)(18,23)(20,29)(21,25)(22,27)(24,31)(26,30)(28,32);(1,3,5,9)(2,6,8,14)(4,12,13,10)(7,15,11,16)(17,20,22,30)(18,24)(19,26)(21,28)(23,31,25,32)(27,29);(1,4)(2,7,8,11)(3,10,9,12)(5,13)(6,15)(14,16)(18,21)(19,23,27,25)(20,28,30,24)(31,32)Polycyclic presentation:
2^10|b^2=hij,c^2=eh,d^2=egi,f^2=j,b^a=bj,c^a=chj,c^b=ce,d^a=dj,d^b=defj,d^c=dfg,e^a=ej,e^c=ej,e^d=ei,f^a=fj,f^c=fh,f^d=fh,f^e=fj,g^a=gj,g^b=ghij,g^c=ghi,g^d=gi,g^f=gj,h^b=hj,h^c=hj,i^b=ij,i^c=ij70 conjugacy classes — view the full character table.
| maximal subgroup of | #72256818, #72263825 |
| maximal normal subgroup of | #72256818, #72263825 |
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.8*F.9*F.10);;
gap> SetPower(coll, 3, F.5*F.8);;
gap> SetPower(coll, 4, F.5*F.7*F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.5*F.6*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
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.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);