| order | 2560 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C27 |
No aliases for this group.
| Fitting | C2×C5×AΣL(1,𝔽16) ⋊ C4 |
| Sylow | C5 ⋊ #146661 |
5000 conjugacy classes of subgroups.
| minimal degree | μ(G) = 17 |
| transitive degree | μt(G) = 80 |
A minimal faithful permutation representation — 3 generators on 17 points:
(2,3,4,5)(10,12)(13,17);(1,2,5,3,4)(7,9)(11,14)(15,16);(6,7)(8,9)(10,11)(12,15,17,14)(13,16)Polycyclic presentation:
2^9,5|a^2=d,c^2=e,b^a=bf,c^a=cg,d^b=dh,d^c=dhi,f^a=fh,f^d=fi,g^a=ghi,g^d=gi,h^a=hi,j^c=j^3,j^e=j^4106 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽5)×#12687, #72242889, #72242920 |
| maximal normal subgroup of | AGL(1,𝔽5)×#12687, #72242889, #72242920 |
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, 2, 5]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 3, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);