| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #46996 |
| commutator, Frattini, cosocle | C25 | C25 |
| prime radical | #245225 | C2 |
| LCS | G ▷ C25 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C22 ▷ C1 | |
3437 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,11,13,7)(4,14)(5,10,16,12)(6,9)(8,15)(17,18)(19,25,27,20)(21,23,30,32)(22,24)(26,28)(29,31);(1,3,6,13)(2,7,9,11)(4,12,15,10)(5,8,16,14)(17,19)(18,20)(21,26)(22,27)(23,28)(24,25)(29,32)(30,31);(1,4)(2,8,9,14)(3,12)(5,7,16,11)(6,15)(10,13)(17,20)(18,19)(21,28,30,29)(22,25)(23,31,32,26)(24,27);(2,9)(5,16)(17,20)(18,19)(21,29)(22,25)(23,26)(24,27)(28,30)(31,32);(1,5,6,16)(2,10)(3,8)(4,7,15,11)(9,12)(13,14)(17,21)(18,23)(19,26,27,31)(20,28,25,29)(22,30)(24,32)Polycyclic presentation:
2^10|a^2=f,b^2=ij,c^2=fghj,e^2=ghi,b^a=bg,c^a=ch,d^a=dhij,d^b=dfghj,d^c=dfghj,e^a=efgj,e^b=efghij,e^c=egij,e^d=ehi,f^b=fi,f^c=fj,f^d=fj,f^e=fi,g^a=gi,g^c=gi,g^d=gj,g^e=gj,h^a=hj,h^b=hi,h^c=hij,h^e=hj64 conjugacy classes — view the full character table.
| maximal subgroup of | #72285190, #72310982, #72338864, … |
| maximal normal subgroup of | #72285190, #72310982, #72338864, … |
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, 1, F.6);;
gap> SetPower(coll, 2, F.9*F.10);;
gap> SetPower(coll, 3, F.6*F.7*F.8*F.10);;
gap> SetPower(coll, 5, F.7*F.8*F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.9*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.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.7*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
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);;
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.9*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);