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