| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C23×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #32002 |
| commutator, Frattini, cosocle | C23×C8 | C24 |
| prime radical | C2×#3067 | C22 |
| LCS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C4 ◁ #20383 ◁ G | |
| LECS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
1446 conjugacy classes of subgroups.
| minimal degree | μ(G) = 36 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 4 generators on 36 points:
(1,2)(3,4)(6,13,17,19)(7,21,23,27)(8,26,25,24)(9,28)(10,30)(11,14)(15,22)(18,31,29,20)(32,34)(33,36);(1,2,3,4)(5,6,14,20,12,17,11,31)(7,22,25,35,23,15,8,16)(9,29,10,19,30,18,28,13)(21,32,26,33,27,36,24,34);(1,2)(3,4)(5,7)(6,15)(8,11)(9,24)(10,21)(12,23)(13,32)(14,25)(16,20)(17,22)(18,34)(19,36)(26,30)(27,28)(29,33)(31,35);(2,4)(5,8,12,25)(6,16)(7,11,23,14)(9,27,30,21)(10,24,28,26)(13,33)(15,31)(17,35)(18,32)(19,34)(20,22)(29,36)Polycyclic presentation:
2^10|a^2=e,b^2=efgij,d^2=ghj,f^2=i,g^2=ij,h^2=i,i^2=j,b^a=bf,c^a=ch,c^b=cfgj,d^a=dfghj,d^b=defhi,d^c=dfhij,e^b=ej,e^c=ej,e^d=ej,f^a=fi,f^b=fi,f^c=fij,f^d=fij,g^a=gij,g^b=gij,g^c=gi,g^d=gi,h^a=hi,h^b=hij,h^c=hij,h^d=hij,i^a=ij,i^b=ij,i^c=ij,i^d=ij88 conjugacy classes — view the full character table.
| maximal subgroup of | #72322543, #72322646 |
| maximal normal subgroup of | #72322543, #72322646 |
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.5*F.6*F.7*F.9*F.10);;
gap> SetPower(coll, 4, F.7*F.8*F.10);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetPower(coll, 8, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.5*F.6*F.8*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.9*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);