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