| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #158314 |
| commutator, Frattini, cosocle | C23×C42 | C24 |
| LCS | G ▷ C23×C42 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C42 ◁ G | |
| LECS | G ▷ C23×C42 ▷ C22 ▷ C1 | |
At least 7145 conjugacy classes of subgroups; only the 780 normal subgroups are shown.
Polycyclic presentation:
2^11|a^2=i,b^2=jk,c^2=g,d^2=fhj,e^2=j,i^2=k,b^a=bik,c^b=cg,d^a=df,d^b=dh,d^c=de,e^a=ek,e^b=ek,f^c=fk,g^d=gj,h^c=hjk,i^b=ik134 conjugacy classes — view the full character table.
| maximal subgroup of | #72250265 |
| maximal normal subgroup of | #72250265 |
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.9);;
gap> SetPower(coll, 2, F.10*F.11);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 4, F.6*F.8*F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 9, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.9*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10*F.11);;
gap> SetConjugate(coll, 9, 2, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);