| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C24×D8 |
| commutator, Frattini, cosocle | C22×C8 | C26 |
| LCS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C2×#3444 ◁ C2×#60204 ◁ G | |
| LECS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
48296 conjugacy classes of subgroups.
| transitive degree | μt(G) = 256 |
Polycyclic presentation:
2^11|f^2=i,h^2=jk,j^2=k,b^a=bh,e^a=eg,e^b=ek,e^c=ei,e^d=eik,f^b=fk,h^a=hj,h^b=hj,j^a=jk,j^b=jk224 conjugacy classes — view the full character table.
| maximal subgroup of | #72322017 |
| maximal normal subgroup of | #72322017 |
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, 6, F.9);;
gap> SetPower(coll, 8, F.10*F.11);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.11);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.11);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> SetConjugate(coll, 10, 2, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);