| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C210 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72238531 |
| commutator | C24×C4 | C23×C4 |
| Frattini, cosocle | C23×#41 | C24 |
| prime radical | #72216064 | C2 |
| LCS | G ▷ C24×C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22×C4 ◁ C23×H(5,𝔽2) ◁ G | |
| LECS | G ▷ C23×#41 ▷ C23 ▷ C2 ▷ C1 | |
39981 conjugacy classes of subgroups.
| transitive degree | μt(G) = 32 |
Polycyclic presentation:
2^11|a^2=ik,c^2=fg,f^2=k,b^a=be,c^a=cf,c^b=ch,d^b=dj,d^c=dk,e^c=ei,e^d=ek,f^c=fi,g^a=gik,g^b=gj,g^c=gi,g^e=gk,g^f=gk,h^a=hi,h^c=hj,i^c=ik,j^a=jk128 conjugacy classes — view the full character table.
| maximal subgroup of | #72302108, #72302118, #72302310, … |
| maximal normal subgroup of | #72302108, #72302118, #72302310, … |
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*F.11);;
gap> SetPower(coll, 3, F.6*F.7);;
gap> SetPower(coll, 6, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.11);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.11);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);