| order | 2048 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | C2×#151342 |
| commutator, Frattini, cosocle | #1781 | C24 |
| prime radical | C2×#151130 | C2 |
| LCS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ C26 ◁ C2×#1781 ◁ G | |
| LECS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
4636 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 32 points:
(3,11)(8,22)(9,21)(12,29)(13,15)(14,28)(16,31)(20,23)(25,27)(30,32);(1,2)(3,12)(4,9)(5,18,19,10)(6,7)(8,14,20,30)(11,27,15,29)(13,25)(16,24,31,26)(17,21)(22,28)(23,32);(2,7)(3,13)(9,21)(10,18)(11,15)(14,30)(24,26)(28,32);(1,3,4,15,6,13,17,11)(2,8,9,23)(5,14,31,28)(7,20,21,22)(10,25,24,27,18,12,26,29)(16,32,19,30)Polycyclic presentation:
2^11|b^2=ghij,d^2=ehij,e^2=h,f^2=k,b^a=bgjk,c^b=ck,d^a=de,d^b=df,d^c=dk,e^a=eh,e^b=eg,e^d=ej,f^a=fgjk,f^b=fijk,f^d=fgjk,f^e=fi,g^b=gj,g^d=gi,g^e=gjk,h^b=hjk,h^f=hk,i^a=ij,i^b=ik,i^d=ijk,i^e=ik,j^d=jk68 conjugacy classes — view the full character table.
| maximal subgroup of | #72340399, #72340478 |
| maximal normal subgroup of | #72340399, #72340478 |
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.9*F.10);;
gap> SetPower(coll, 4, F.5*F.8*F.9*F.10);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.7*F.10*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.10*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.9*F.10*F.11);;
gap> SetConjugate(coll, 6, 4, F.6*F.7*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.10*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.10*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, 4, F.9*F.10*F.11);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> SetConjugate(coll, 10, 4, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);