| 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 25497 conjugacy classes of subgroups; only the 7352 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 20 points:
(6,8)(9,10,12,11)(13,14,16,15)(17,18,19,20);(5,6)(7,8)(17,18)(19,20);(6,8)(9,10)(11,12)(13,14)(15,16);(2,4)(9,10,12,11)(14,15)(17,18)(19,20);(2,4)(10,11)(13,14,16,15)(17,18)(19,20);(1,2)(3,4)(5,6)(7,8)(9,11,12,10)(13,15,16,14)Polycyclic presentation:
2^11|a^2=g,d^2=gh,e^2=hk,f^2=gk,b^a=bgj,c^a=cgk,c^b=cgjk,d^a=dh,d^c=dgk,e^a=eghk,e^c=egk,e^d=egk,f^a=fgjk,f^c=fj,f^d=fi,f^e=fgik272 conjugacy classes — view the full character table.
| maximal subgroup of | #72335839 |
| maximal normal subgroup of | #72335839 |
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.7);;
gap> SetPower(coll, 4, F.7*F.8);;
gap> SetPower(coll, 5, F.8*F.11);;
gap> SetPower(coll, 6, F.7*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.7*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.10*F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8*F.11);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.10*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.7*F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);