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