| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #147749 |
| commutator | C2×#127 | C22×C4 |
| Frattini, cosocle | C22×#127 | C23 |
| prime radical | C2×#33557 | C2 |
| LCS | G ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C24 ◁ C23×C4 ◁ C22×#127 ◁ G | |
| LECS | G ▷ C22×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
2859 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,8)(4,17)(5,11)(6,10)(7,12)(9,20)(13,28)(14,23)(15,24)(16,27)(18,31)(19,26)(21,25)(22,30)(29,32);(1,3,7,15)(2,8,12,24)(4,18,21,30)(5,16)(6,14)(9,22,26,31)(10,27)(11,23)(13,20,29,19)(17,28,25,32);(1,4,6,21,7,20,5,19)(2,9,11,25,12,17,10,26)(3,13,14,29,15,30,16,18)(8,22,27,32,24,28,23,31)Polycyclic presentation:
2^10|b^2=ej,c^2=defij,f^2=ij,h^2=j,b^a=be,c^a=ceg,c^b=cd,d^a=dh,d^b=dhij,d^c=dij,e^c=ehi,e^d=ei,f^a=fh,f^b=fhj,f^c=fhj,f^d=fij,f^e=fij,g^c=ghij,g^d=gi,g^f=gij,h^a=hj,h^b=hi,h^c=hj,h^d=hj,h^e=hj,h^g=hj,i^a=ij,i^b=ij,i^c=ij64 conjugacy classes — view the full character table.
| maximal subgroup of | #72319495, #72319795 |
| maximal normal subgroup of | #72319495, #72319795 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 2, F.5*F.10);;
gap> SetPower(coll, 3, F.4*F.5*F.6*F.9*F.10);;
gap> SetPower(coll, 6, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.5*F.7);;
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.8*F.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*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, 3, F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);