| order | 2048 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C24×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72216457 |
| commutator, Frattini, cosocle | #1781 | C24 |
| LCS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C24 ◁ C23×D4 ◁ #20585 ◁ G | |
| LECS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
4250 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 32 points:
(1,2)(3,11)(4,16,19,9)(5,20)(6,7)(8,14,12,27)(10,21)(13,30)(15,25)(17,28)(18,26,22,24)(23,32,29,31);(3,12,15,8)(5,21)(9,16)(11,27,25,14)(13,29,17,23)(28,31,30,32);(1,3)(2,8,6,12)(4,17,19,13)(5,14,21,27)(7,15)(9,23)(10,25)(11,20)(16,29)(18,32)(22,31)(24,28,26,30);(1,4,7,19)(2,9)(3,13,15,17)(5,22,21,18)(6,16)(8,23)(10,26)(11,28)(12,29)(14,32,27,31)(20,24)(25,30)Polycyclic presentation:
2^11|a^2=ghijk,b^2=jk,c^2=ik,d^2=hi,e^2=hik,f^2=hk,b^a=bhjk,c^a=ce,c^b=cf,d^a=dijk,d^b=dghk,d^c=dhij,e^a=eh,e^b=eg,e^c=ehijk,e^d=ek,f^a=fgik,f^b=fh,f^c=fhj,f^d=fik,f^e=fik,g^a=gk,g^c=gi,g^d=gj,g^e=gjk,g^f=gj,h^a=hjk,h^d=hk,h^e=hk,i^a=ij,i^b=ijk,i^d=ik,i^e=ik,i^f=ik,j^c=jk56 conjugacy classes — view the full character table.
| maximal subgroup of | #72284259, #72285484, #72286327, … |
| maximal normal subgroup of | #72284259, #72285484, #72286327, … |
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*F.8*F.9*F.10*F.11);;
gap> SetPower(coll, 2, F.10*F.11);;
gap> SetPower(coll, 3, F.9*F.11);;
gap> SetPower(coll, 4, F.8*F.9);;
gap> SetPower(coll, 5, F.8*F.9*F.11);;
gap> SetPower(coll, 6, F.8*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.8*F.10*F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.9*F.10*F.11);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.8*F.11);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9*F.10*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.9*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.11);;
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.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10*F.11);;
gap> SetConjugate(coll, 9, 4, F.9*F.11);;
gap> SetConjugate(coll, 9, 5, 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);