| 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 | #72237816 |
| commutator | #2308 | C22×C4 |
| Frattini, cosocle | #20585 | C23 |
| prime radical | #72234627 | C2 |
| LCS | G ▷ #2308 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C24 ◁ C23×D4 ◁ #6432953 ◁ G | |
| LECS | G ▷ #20585 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
4624 conjugacy classes of subgroups; only the 90 normal subgroups are shown.
This group has 4624 conjugacy classes of subgroups — too many to draw. Only its 90 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:
(2,7)(8,20)(9,24)(10,17)(11,22)(14,28)(21,25)(23,31)(26,32)(27,29);(2,8)(7,20)(9,23)(10,14)(11,22)(12,18)(17,28)(21,32)(24,31)(25,26);(1,2,3,9)(4,14,11,26,16,8,22,23)(5,17,18,24)(6,10,13,25)(7,12,21,19)(15,28,29,32,30,20,27,31)Polycyclic presentation:
2^11|c^2=d,d^2=hj,e^2=hi,c^a=cf,c^b=ce,d^a=dh,d^b=dg,e^a=ehi,e^b=ehi,e^c=eghijk,e^d=eij,f^b=fhi,f^c=fh,f^d=fk,g^a=gj,g^c=gi,g^d=gj,g^e=gjk,g^f=gk,h^b=hj,h^c=hk,h^e=hk,i^b=ij,i^c=ij,i^d=ik,i^e=ik,j^c=jk56 conjugacy classes — view the full character table.
| maximal subgroup of | #72338791, #72338807, #72341156 |
| maximal normal subgroup of | #72338791, #72338807, #72341156 |
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.4);;
gap> SetPower(coll, 4, F.8*F.10);;
gap> SetPower(coll, 5, F.8*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
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, 5, 1, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.8*F.9*F.10*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.11);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.11);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);