| 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 | #23708 |
| 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 | |
2171 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,10,17,12,21,22,20)(7,9,24,30,25,15,27,32)(8,28,16,34,26,14,29,31)(11,33,23,18,35,19,13,36);(5,7,22,27,12,25,10,24)(6,14,17,31,21,28,20,34)(8,23,29,11,26,13,16,35)(9,19,30,36,15,33,32,18);(5,8)(6,15)(7,23)(9,21)(10,16)(11,27)(12,26)(13,25)(14,33)(17,32)(18,31)(19,28)(20,30)(22,29)(24,35)(34,36);(2,4)(5,9,10,32,12,15,22,30)(6,16,17,8,21,29,20,26)(7,19,27,36,25,33,24,18)(11,34,23,28,35,31,13,14)Polycyclic presentation:
2^10|a^2=e,b^2=eg,d^2=gij,e^2=j,f^2=ij,h^2=i,i^2=j,b^a=bh,c^a=chij,d^a=defi,d^b=dg,d^c=dg,e^d=ej,f^a=fi,f^b=fij,f^c=fi,f^d=fi,g^a=gj,g^d=gj,h^a=hij,h^b=hi,h^c=hij,h^d=hij,i^a=ij,i^b=ij,i^c=ij,i^d=ij106 conjugacy classes — view the full character table.
| maximal subgroup of | #72321453, #72321747, #72322221, … |
| maximal normal subgroup of | #72321453, #72321747, #72322221, … |
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.7);;
gap> SetPower(coll, 4, F.7*F.9*F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, 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.8*F.9*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.5*F.6*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
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*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*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);