| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #123275 |
| commutator | C8×C16 | C22×C4 |
| Frattini, cosocle | C2×C8×C16 | C23 |
| prime radical | C2×#123403 | C2 |
| LCS | G ▷ C8×C16 ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C2×C4×C8 ◁ C2×C8×C16 ◁ G | |
| LECS | G ▷ C2×C8×C16 ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
1230 conjugacy classes of subgroups; only the 140 normal subgroups are shown.
This group has 1230 conjugacy classes of subgroups — too many to draw. Only its 140 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 36 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 3 generators on 36 points:
(1,2,3,4)(5,6)(7,11)(8,12)(9,14)(10,16)(13,18)(15,19)(17,22)(20,24)(21,26)(23,28)(25,33)(27,32)(29,35)(30,34)(31,36);(7,18)(8,19)(9,22)(11,13)(12,15)(14,17)(20,36)(21,34)(23,35)(24,31)(25,27)(26,30)(28,29)(32,33);(6,11)(7,18)(8,19)(9,22)(12,25)(13,15)(14,27)(16,26)(17,24)(20,36)(21,34)(23,35)(28,31)(29,30)(32,33)Polycyclic presentation:
2^11|a^2=f,d^2=gi,e^2=hj,g^2=i,h^2=jk,j^2=k,c^a=ce,c^b=cd,d^a=dh,d^b=dg,d^c=dg,e^a=eh,e^b=eh,e^c=eh,g^a=gj,g^b=gi,g^c=gi,h^a=hj,h^b=hj,h^c=hj,i^a=ik,j^a=jk,j^b=jk,j^c=jk188 conjugacy classes — view the full character table.
| maximal subgroup of | #72225219, #72226858, #72226958 |
| maximal normal subgroup of | #72225219, #72226858, #72226958 |
| maximal quotient of | #72227142 |
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.6);;
gap> SetPower(coll, 4, F.7*F.9);;
gap> SetPower(coll, 5, F.8*F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10*F.11);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> SetConjugate(coll, 10, 2, F.10*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);