| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C4×C8 · Schur multiplier (H2) = C23×C8 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C22×C4 | #1957 |
| commutator | C4×C8 | C2×C4×C8 |
| Frattini, cosocle | C2×C42×C8 | C23 |
| socle | C23 | #9638 |
| prime radical | C24 | #1962 |
| LCS | G ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22×C4 ◁ C22×C4×C8 ◁ C2×C4×C82 ◁ G | |
| LECS | G ▷ C2×C42×C8 ▷ C22×C4 ▷ C2 ▷ C1 | |
2508 conjugacy classes of subgroups.
Polycyclic presentation:
2^11|a^2=d,b^2=f,c^2=gj,d^2=k,e^2=hk,f^2=i,g^2=j,h^2=k,b^a=be,c^a=cg,e^a=eh,e^b=ej,f^a=fhjk,g^a=gj,h^a=hk,i^a=ik368 conjugacy classes — view the full character table.
| maximal subgroup of | #72210590, #72210783 |
| maximal normal subgroup of | #72210590 |
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.4);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 3, F.7*F.10);;
gap> SetPower(coll, 4, F.11);;
gap> SetPower(coll, 5, F.8*F.11);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.10);;
gap> SetPower(coll, 8, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.10*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);