| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72231727 |
| commutator, Frattini, cosocle | C2×#131 | C25 |
| LCS | G ▷ C2×#131 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C2×C4 ◁ #2875 ◁ G | |
| LECS | G ▷ C2×#131 ▷ C2×C4 ▷ C2 ▷ C1 | |
At least 31917 conjugacy classes of subgroups; only the 1026 normal subgroups are shown.
Polycyclic presentation:
2^11|b^2=ik,c^2=ik,d^2=k,e^2=g,g^2=j,j^2=k,d^a=dk,d^b=dk,e^a=eh,e^b=eg,e^c=ej,e^d=ef,f^a=fi,f^b=fk,f^e=fk,g^b=gj,g^c=gk,g^d=gk,h^d=hik,h^f=hk,i^e=ik,j^b=jk116 conjugacy classes — view the full character table.
| maximal quotient of | #72257323 |
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, 2, F.9*F.11);;
gap> SetPower(coll, 3, F.9*F.11);;
gap> SetPower(coll, 4, F.11);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 7, F.10);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.11);;
gap> SetConjugate(coll, 4, 2, F.4*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.6);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.9*F.11);;
gap> SetConjugate(coll, 8, 6, F.8*F.11);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> SetConjugate(coll, 10, 2, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);