| order | 6400 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Sylow | C52 ⋊ #20890 |
3796 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,8,9,10)(11,14,15,22)(12,17,18,21)(13,19,20,26)(16,24,23,25);(11,13)(12,16)(14,19)(15,20)(17,24)(18,23)(21,25)(22,26);(2,3,4,5)(7,9,10,8)(14,22)(16,23)(17,21)(19,26);(2,3,4,5)(7,8,10,9)(11,12,15,18)(13,16,20,23)(14,21,22,17)(19,25,26,24)Polycyclic presentation:
2^8,5^2|a^2=e,b^2=eh,d^2=h,b^a=bf,c^b=cfg,d^a=dh,d^b=dh,f^c=fh,g^a=gh,g^c=gh,i^a=i^2,i^b=i^3,i^e=i^4,j^a=i^3j^3,j^b=j^3,j^e=j^4142 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.5);;
gap> SetPower(coll, 2, F.5*F.8);;
gap> SetPower(coll, 4, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> SetConjugate(coll, 9, 2, F.9^3);;
gap> SetConjugate(coll, 9, 5, F.9^4);;
gap> SetConjugate(coll, 10, 1, F.9^3*F.10^3);;
gap> SetConjugate(coll, 10, 2, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);