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