| order | 2048 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #152191 |
| commutator | #492 | C2×C42 |
| Frattini, cosocle | C2×#3151 | C23 |
| prime radical | C2×#18524 | C22 |
| LCS | G ▷ #492 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23 ◁ C23×C4 ◁ C22×C42 ◁ C2×#3151 ◁ G | |
| LECS | G ▷ C2×#3151 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
3961 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 3 generators on 20 points:
(1,2,4,3)(6,11,13,17,15,12,14,20);(1,2,4,3)(6,12,15,11)(13,17,14,20);(1,3,4,2)(5,6)(7,12,16,11)(8,17,18,20)(9,14)(10,15)(13,19)Polycyclic presentation:
2^11|a^2=d,b^2=dhj,c^2=defgj,d^2=j,e^2=k,f^2=i,h^2=j,i^2=k,b^a=bh,c^a=cf,c^b=ce,d^b=dj,d^c=dik,e^a=eh,e^c=ejk,e^d=ej,f^b=fhj,f^c=fijk,f^e=fi,g^a=ghj,g^b=ghj,g^d=gj,g^e=gijk,g^f=gi,h^b=hj,h^c=hi,h^e=hj,h^g=hj,i^b=ij,i^c=ik,i^e=ik,i^g=ik,j^c=jk92 conjugacy classes — view the full character table.
| maximal subgroup of | #72309267 |
| maximal normal subgroup of | #72309267 |
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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.4*F.8*F.10);;
gap> SetPower(coll, 3, F.4*F.5*F.6*F.7*F.10);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.11);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetPower(coll, 9, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9*F.10*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> SetConjugate(coll, 9, 7, F.9*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);