| order | 2560 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C42 · Schur multiplier (H2) = C24×C42 |
No aliases for this group.
| Fitting | C5×#1781 ⋊ C4 |
| Sylow | C5 ⋊ #355096 |
5520 conjugacy classes of subgroups.
| minimal degree | μ(G) = 21 |
| transitive degree | μt(G) = 80 |
A minimal faithful permutation representation — 4 generators on 21 points:
(1,2,5,3,4)(11,20)(19,21);(6,9)(7,12)(8,14)(10,18)(11,19)(13,16)(15,17)(20,21);(2,3,4,5)(6,8)(7,11)(9,17)(10,15)(12,21)(13,20)(14,18)(16,19);(2,3,4,5)(6,7)(8,11)(9,16,18,12)(10,13)(14,21,17,19)(15,20)Polycyclic presentation:
2^9,5|a^2=e,b^2=ef,c^a=ch,c^b=ci,d^a=dg,d^b=dh,e^c=ei,f^c=fi,g^b=gi,h^a=hi,j^a=j^3,j^b=j^3,j^e=j^4124 conjugacy classes — view the full character table.
| maximal subgroup of | #72269861, AGL(1,𝔽5)×#21776 |
| maximal normal subgroup of | #72269861, AGL(1,𝔽5)×#21776 |
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.5);;
gap> SetPower(coll, 2, F.5*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^3);;
gap> SetConjugate(coll, 10, 2, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);