| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C2×#2404 |
| commutator, Frattini, cosocle | C26 | C25 |
| LCS | G ▷ C26 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C27 ◁ G | |
| LECS | G ▷ C26 ▷ C2 ▷ C1 | |
At least 8940 conjugacy classes of subgroups; only the 1900 normal subgroups are shown.
Polycyclic presentation:
2^11|c^2=f,d^2=gj,e^2=k,b^a=bg,c^a=cg,c^b=cgi,d^a=dgh,d^b=dik,d^c=dfghj,e^a=efgik,e^b=ek,e^d=efgik,f^d=fk,h^e=hk,j^c=jk,j^e=jk182 conjugacy classes — view the full character table.
| maximal subgroup of | #72266430, #72266552, #72266625 |
| maximal normal subgroup of | #72266430, #72266552, #72266625 |
| maximal quotient of | #72331363, #72331812 |
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, 3, F.6);;
gap> SetPower(coll, 4, F.7*F.10);;
gap> SetPower(coll, 5, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.9*F.11);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.7*F.9*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.6*F.7*F.9*F.11);;
gap> SetConjugate(coll, 6, 4, F.6*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> SetConjugate(coll, 10, 5, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);