| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72266518 |
| commutator, Frattini, cosocle | C25 | C26 |
| LCS | G ▷ C25 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C2 ▷ C1 | |
At least 9798 conjugacy classes of subgroups; only the 3054 normal subgroups are shown.
Polycyclic presentation:
2^11|c^2=g,c^a=ci,d^b=dgj,d^c=dgj,e^a=eik,e^b=eh,e^c=eijk,e^d=ei,f^a=fh,f^d=fj,g^a=gk,g^e=gk,h^d=hk,i^c=ik,j^a=jk134 conjugacy classes — view the full character table.
| maximal subgroup of | #72334963, #72335113, #72337368 |
| maximal normal subgroup of | #72334963, #72335113, #72337368 |
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, 3, F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.10*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.11);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);