| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #21526 |
| commutator | C22×C8 | C23×C4 |
| Frattini, cosocle | C23×C8 | C24 |
| prime radical | C2×#3067 | C22 |
| LCS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C4 ◁ C2×#2875 ◁ G | |
| LECS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
2116 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)(5,6,12,19,9,28,10,17,14,20,30,7,13,16,11,18)(8,22,26,21,29,36,25,33,27,15,31,35,23,32,24,34);(1,2,3,4)(5,7,9,17,14,19,13,18)(6,10,16,30,20,11,28,12)(8,21,23,33,27,35,29,34)(15,24,32,31,22,25,36,26);(1,2)(3,4)(5,8,9,29,14,27,13,23)(6,15,28,32,20,22,16,36)(7,21,18,33,19,35,17,34)(10,25,30,31,11,24,12,26);(2,4)(5,6,14,20)(7,11,19,10)(8,22)(9,16,13,28)(12,18,30,17)(15,27)(21,24)(23,36)(25,35)(26,34)(29,32)(31,33)Polycyclic presentation:
2^10|a^2=h,b^2=e,c^2=ij,d^2=ghj,e^2=j,f^2=i,g^2=i,h^2=ij,i^2=j,b^a=bf,c^a=cj,c^b=cei,d^a=dfij,d^b=dfgij,d^c=deij,e^a=ej,e^c=ej,f^b=fi,f^c=fj,f^d=fij,g^b=gi,g^c=gj,g^d=gij,h^b=hij,h^d=hi,i^b=ij,i^d=ij106 conjugacy classes — view the full character table.
| maximal subgroup of | #72322386, #72322543, #72322591, … |
| maximal normal subgroup of | #72322386, #72322543, #72322591, … |
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.8);;
gap> SetPower(coll, 2, F.5);;
gap> SetPower(coll, 3, F.9*F.10);;
gap> SetPower(coll, 4, F.7*F.8*F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.9*F.10);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.6*F.9*F.10);;
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.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.9);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);