| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #612424 |
| commutator, Frattini, cosocle | C22×C42 | C25 |
| LCS | G ▷ C22×C42 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C42 ◁ G | |
| LECS | G ▷ C22×C42 ▷ C22 ▷ C1 | |
At least 9230 conjugacy classes of subgroups; only the 1244 normal subgroups are shown.
Polycyclic presentation:
2^11|d^2=fgij,f^2=j,g^2=j,i^2=k,c^a=ch,d^a=df,d^b=dfgj,d^c=dj,e^d=eik,f^a=fj,f^b=fk,f^c=fk,f^e=fjk,g^a=gjk,g^b=gk,g^c=gk,g^e=gjk,h^d=hk,i^a=ijk,i^e=ik128 conjugacy classes — view the full character table.
| maximal subgroup of | #72287153 |
| maximal normal subgroup of | #72287153 |
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, 4, F.6*F.7*F.9*F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetPower(coll, 9, F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.10*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.11);;
gap> SetConjugate(coll, 7, 3, F.7*F.11);;
gap> SetConjugate(coll, 7, 5, F.7*F.10*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.10*F.11);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);