| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C24 | C24×D4 |
| commutator, Frattini, cosocle | C23×C4 | C26 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ #608791 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
At least 6190 conjugacy classes of subgroups; only the 4776 normal subgroups are shown.
Polycyclic presentation:
2^11|a^2=i,c^2=i,d^2=k,f^2=j,j^2=k,c^b=cg,d^a=dk,d^b=dh,e^c=eik,e^d=ek,f^a=fj,f^c=fk,j^a=jk206 conjugacy classes — view the full character table.
| maximal subgroup of | #72308179 |
| maximal normal subgroup of | #72308179 |
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, 3, F.9);;
gap> SetPower(coll, 4, F.11);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.11);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);