| order | 2560 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C42 · Schur multiplier (H2) = C28 |
No aliases for this group.
| Fitting | C5×#2883 ⋊ C4 |
| Sylow | C5 ⋊ #355922 |
5410 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)(6,9)(7,12)(8,16)(10,18)(11,19)(13,17)(14,20)(15,21);(6,8)(7,11)(9,16)(10,15)(12,19)(13,14)(17,20)(18,21);(2,3,4,5)(8,15)(16,21);(6,7)(8,14,15,11)(9,17,18,12)(10,13)(16,19)(20,21)Polycyclic presentation:
2^9,5|a^2=f,b^2=e,b^a=bfg,c^a=ch,c^b=chi,d^a=dh,f^c=fi,f^d=fi,g^d=gi,h^a=hi,j^b=j^3,j^e=j^4133 conjugacy classes — view the full character table.
| maximal subgroup of | #72269866, AGL(1,𝔽5)×#21776, #72269870 |
| maximal normal subgroup of | #72269866, AGL(1,𝔽5)×#21776, #72269870 |
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.6);;
gap> SetPower(coll, 2, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.6*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.8*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);