| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C25×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #46996 |
| commutator, Frattini, cosocle | C25 | C25 |
| LCS | G ▷ C25 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C22 ▷ C1 | |
3987 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 5 generators on 32 points:
(1,2)(3,9)(4,8)(5,6)(7,11)(10,16)(12,15)(13,14)(20,29)(23,27)(24,32)(25,30);(1,3)(2,7,5,9)(4,12)(6,11)(8,16,14,15)(10,13)(17,18)(19,27,28,23)(20,24,29,32)(21,30)(22,26)(25,31);(1,4,6,13)(2,8)(3,10)(5,14)(7,15,9,16)(11,12)(17,19)(18,23)(20,21,29,31)(22,28)(24,30,32,25)(26,27);(1,2)(3,9,11,7)(4,8)(5,6)(10,15,12,16)(13,14)(17,20,22,29)(18,24,26,32)(19,21)(23,25)(27,30)(28,31);(1,5,6,2)(3,7)(4,8)(9,11)(10,16,12,15)(13,14)(17,21)(18,25,26,30)(19,20,28,29)(22,31)(23,24)(27,32)Polycyclic presentation:
2^10|b^2=f,c^2=fgi,d^2=gj,e^2=gh,b^a=bg,c^a=ch,c^b=chi,d^a=dgj,d^b=dfghj,d^c=dgh,e^a=egh,e^b=efgi,e^c=efhj,e^d=ehj,f^a=fi,f^c=fj,f^d=fij,f^e=fi,g^b=gi,g^c=gj,g^e=gj,h^b=hj,h^c=hi,h^d=hj,h^e=hj64 conjugacy classes — view the full character table.
| maximal subgroup of | #72285163, #72337590, #72338686, … |
| maximal normal subgroup of | #72285163, #72337590, #72338686, … |
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.6);;
gap> SetPower(coll, 3, F.6*F.7*F.9);;
gap> SetPower(coll, 4, F.7*F.10);;
gap> SetPower(coll, 5, F.7*F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.8*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.7*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.6*F.8*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);