| order | 6400 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Fitting | C52×#127 ⋊ C2×C4 |
| Sylow | C52 ⋊ #21690 |
3720 conjugacy classes of subgroups.
| minimal degree | μ(G) = 22 |
| transitive degree | μt(G) = 160 |
A minimal faithful permutation representation — 4 generators on 22 points:
(2,4)(6,11)(7,12)(9,10)(13,14,16,15)(18,19,20,21);(6,10)(9,11)(14,15,16,17)(19,21,20,22);(1,2)(3,4)(6,9)(7,12)(10,11);(5,6,7,11,8,10,12,9)(19,20)(21,22)Polycyclic presentation:
2^8,5^2|a^2=g,c^2=e,d^2=e,g^2=h,b^a=bg,c^a=ch,d^a=dgh,d^b=df,g^b=gh,g^d=gh,i^a=i^4,i^c=i^3,i^d=i^3,i^e=i^4,j^a=i^3j,j^c=j^3,j^d=j^3,j^e=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.7);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 4, F.5);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^4);;
gap> SetConjugate(coll, 9, 3, F.9^3);;
gap> SetConjugate(coll, 9, 4, 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, 4, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);