| order | 6400 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C42 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Sylow | C52 ⋊ C4×#413 |
4868 conjugacy classes of subgroups.
| minimal degree | μ(G) = 26 |
| transitive degree | μt(G) = 80 |
A minimal faithful permutation representation — 4 generators on 26 points:
(2,3,4,5)(6,7,8,9);(1,2,5,3,4)(13,21)(16,20)(22,23)(25,26);(11,13,15,21)(12,16,19,20)(14,23,24,22)(17,26,18,25);(7,8)(9,10)(11,12,14,17,15,19,24,18)(13,20,22,26,21,16,23,25)Polycyclic presentation:
2^8,5^2|a^2=f,b^2=h,d^2=e,f^2=h,g^2=h,b^a=bfgh,c^b=ch,f^b=fh,g^a=gh,g^b=gh,i^a=i^4,i^d=i^3,i^e=i^4,j^a=i^3j,j^d=j^3,j^e=j^4172 conjugacy classes — view the full character table.
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, 5, 5]);;
gap> SetPower(coll, 1, F.6);;
gap> SetPower(coll, 2, F.8);;
gap> SetPower(coll, 4, F.5);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6*F.7*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^4);;
gap> SetConjugate(coll, 9, 4, F.9^3);;
gap> SetConjugate(coll, 9, 5, F.9^4);;
gap> SetConjugate(coll, 10, 1, F.9^3*F.10);;
gap> SetConjugate(coll, 10, 4, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);