| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C24×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#1972 |
| commutator | C4×C8 | C23×C4 |
| Frattini, cosocle | C2×C4×C8 | C24 |
| prime radical | #7623255 | C2 |
| LCS | G ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C42 ◁ #20473 ◁ G | |
| LECS | G ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
1478 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 4 generators on 32 points:
(1,2,4,8,6,9,5,14)(3,10,12,15,11,16,13,7)(18,22,24,29)(19,25)(20,27)(23,28,31,30)(26,32);(17,18,19,22,20,23,25,30,21,24,26,29,27,31,32,28);(1,3,6,11)(2,7)(4,12,5,13)(8,10)(9,15)(14,16)(18,23,24,31)(19,26)(22,28,29,30)(25,32);(3,11)(7,15)(10,16)(12,13)Polycyclic presentation:
2^10|a^2=e,b^2=f,c^2=egi,e^2=i,f^2=h,g^2=i,h^2=j,b^a=bf,c^a=cg,c^b=chj,d^c=di,e^b=ej,f^a=fh,f^c=fj,g^a=gi,h^a=hj88 conjugacy classes — view the full character table.
| maximal subgroup of | #72321935 |
| maximal normal subgroup of | #72321935 |
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.5);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 3, F.5*F.7*F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, 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.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);