| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C217 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C26 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
At least 25939 conjugacy classes of subgroups; only the 6248 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 20 points:
(10,12)(17,18)(19,20);(9,10)(11,12)(13,14)(15,16)(18,20);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(14,16)(17,18)(19,20);(2,3)(6,8)(13,14)(15,16);(6,8);(1,3,4,2)(5,6)(7,8)(9,10)(11,12)(13,14)(15,16)Polycyclic presentation:
2^11|f^2=gijk,b^a=bh,c^a=ck,c^b=cj,d^c=dhi,e^c=eg,f^a=fk,f^c=fghi,f^d=fijk,f^e=fg248 conjugacy classes — view the full character table.
| maximal subgroup of | #72336150 |
| maximal normal subgroup of | #72336150 |
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, 6, F.7*F.9*F.10*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);