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