| order | 2048 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72237777 |
| commutator | #1781 | C22×C4 |
| Frattini, cosocle | #20586 | C23 |
| prime radical | #72241387 | C2 |
| LCS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C24 ◁ C23×D4 ◁ #20586 ◁ G | |
| LECS | G ▷ #20586 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
2344 conjugacy classes of subgroups; only the 82 normal subgroups are shown.
This group has 2344 conjugacy classes of subgroups — too many to draw. Only its 82 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(3,12)(4,9)(8,19)(10,22)(14,26)(15,28)(16,17)(23,31)(25,29)(30,32);(1,2)(3,12)(4,5,9,21)(6,22,24,10)(7,11)(8,14,26,19)(13,27)(15,28)(16,17)(18,20)(23,31)(25,30,32,29);(1,3,13,29)(2,8,18,31,11,26,27,28)(4,17,22,32)(5,19,6,23,21,14,24,15)(7,16,20,30)(9,12,10,25)Polycyclic presentation:
2^11|b^2=ghjk,c^2=efhijk,d^2=h,f^2=hijk,b^a=bghjk,c^a=cd,c^b=ce,d^a=dh,d^b=dg,d^c=dh,e^a=eg,e^b=eik,e^c=egij,e^d=eij,f^a=fg,f^b=fg,f^c=fgij,f^d=fij,f^e=fij,g^b=gjk,g^c=gi,g^d=gjk,g^f=gj,h^b=hjk,h^e=hk,h^f=hk,i^a=ij,i^b=ik,i^c=ij,i^d=ik,i^f=ik,j^c=jk56 conjugacy classes — view the full character table.
| maximal subgroup of | #72286190, #72338995 |
| maximal normal subgroup of | #72286190, #72338995 |
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.7*F.8*F.10*F.11);;
gap> SetPower(coll, 3, F.5*F.6*F.8*F.9*F.10*F.11);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 6, F.8*F.9*F.10*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.7*F.8*F.10*F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
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.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.9*F.11);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.11);;
gap> SetConjugate(coll, 8, 6, F.8*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.11);;
gap> SetConjugate(coll, 9, 6, F.9*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);