| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #130062 |
| commutator | #379 | C2×C42 |
| Frattini, cosocle | C22×#379 | C23 |
| prime radical | C2×#23984 | C22 |
| LCS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C26 ◁ C22×#379 ◁ G | |
| LECS | G ▷ C22×#379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
8238 conjugacy classes of subgroups.
| transitive degree | μt(G) = 32 |
Polycyclic presentation:
2^11|a^2=g,b^2=k,c^2=d,f^2=i,b^a=bf,c^a=ce,e^a=ej,e^b=eh,f^b=fi,f^c=fhjk,f^e=fj,g^b=gi,g^c=gj,h^a=hj,h^f=hk,i^c=ik,j^b=jk116 conjugacy classes — view the full character table.
| maximal subgroup of | #72291986, #72292097, #72292108 |
| maximal normal subgroup of | #72291986, #72292097, #72292108 |
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.7);;
gap> SetPower(coll, 2, F.11);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 2, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);