| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#23900 |
| commutator, Frattini, cosocle | C23×D4 | C25 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ C22×#534 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
50800 conjugacy classes of subgroups.
| transitive degree | μt(G) = 32 |
Polycyclic presentation:
2^11|b^2=i,d^2=j,e^2=j,g^2=k,b^a=bi,d^b=dh,d^c=dk,e^a=ef,e^b=eg,e^c=ek,f^b=fi,g^a=gi,g^d=gj,g^e=gk,g^f=gk,h^e=hj,i^e=ik128 conjugacy classes — view the full character table.
| maximal subgroup of | #72237495, #72260825, #72262651, … |
| maximal normal subgroup of | #72237495, #72260825, #72262651, … |
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, 2, F.9);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 7, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);