| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #245225 |
| commutator, Frattini, cosocle | C22×#127 | C24 |
| LCS | G ▷ C22×#127 ▷ C24 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#127 ◁ G | |
| LECS | G ▷ C22×#127 ▷ C24 ▷ C22 ▷ C1 | |
11323 conjugacy classes of subgroups; only the 160 normal subgroups are shown.
This group has 11323 conjugacy classes of subgroups — too many to draw. Only its 160 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| transitive degree | μt(G) = 128 |
Polycyclic presentation:
2^11|c^2=j,d^2=k,c^a=ce,c^b=cg,d^a=df,e^b=eh,e^d=ei,f^c=fijk,f^e=fjk,g^a=ghj,g^e=gj,g^f=gk,h^c=hj,h^d=hk,i^a=ijk,i^b=ik74 conjugacy classes — view the full character table.
| maximal subgroup of | #72241397, #72252387, #72252413, … |
| maximal normal subgroup of | #72252387, #72252413, #72267054, … |
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.10);;
gap> SetPower(coll, 4, F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.10*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.10*F.11);;
gap> SetConjugate(coll, 9, 2, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);