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