| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C2×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #31680 |
| commutator, Frattini, cosocle | C23×C8 | C24 |
| prime radical | C22×#493 | C22 |
| LCS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C4 ◁ #20435 ◁ G | |
| LECS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
1619 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,14)(7,20)(8,23)(9,12)(10,11)(15,33)(16,34)(17,18)(19,27)(21,22)(24,25)(26,28)(29,30)(31,32);(1,2)(3,4)(5,6,9,17,13,19,12,30)(7,16,21,33,8,15,24,34)(10,27,26,18,28,14,11,29)(20,36,25,32,23,35,22,31);(1,2)(3,4)(5,7,9,21,13,8,12,24)(6,15,30,33,19,16,17,34)(10,22,26,20,28,25,11,23)(14,31,18,35,27,32,29,36);(2,4)(5,8,9,24,13,7,12,21)(6,16,17,33,19,15,30,34)(10,25,26,23,28,22,11,20)(14,32,29,35,27,31,18,36)Polycyclic presentation:
2^10|b^2=e,c^2=ghij,d^2=e,e^2=j,f^2=ij,g^2=ij,h^2=i,i^2=j,b^a=bh,c^a=cg,c^b=cgh,d^a=df,d^b=dfgij,d^c=defhi,e^a=ej,f^a=fi,f^b=fij,f^c=fij,f^d=fij,g^a=gi,g^b=gij,g^c=gij,g^d=gij,h^a=hij,h^b=hi,h^c=hij,h^d=hij,i^a=ij,i^b=ij,i^c=ij,i^d=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72322333, #72322662 |
| maximal normal subgroup of | #72322333, #72322662 |
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.5);;
gap> SetPower(coll, 3, F.7*F.8*F.9*F.10);;
gap> SetPower(coll, 4, F.5);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.9*F.10);;
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.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.5*F.6*F.8*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9*F.10);;
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);;
gap> SetConjugate(coll, 7, 2, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
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);