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