| order | 2560 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C5×#8453 ⋊ C2 |
| Sylow | C5 ⋊ #144366 |
4166 conjugacy classes of subgroups; only the 101 normal subgroups are shown.
This group has 4166 conjugacy classes of subgroups — too many to draw. Only its 101 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 21 |
| transitive degree | μt(G) = 80 |
A minimal faithful permutation representation — 3 generators on 21 points:
(1,3)(2,5)(4,8)(6,7)(9,10,12,15)(11,14,16,13)(17,18,20,21,19);(5,7)(10,14)(13,15)(18,19)(20,21);(1,2)(3,7,8,5)(4,6)(10,13,15,14)Polycyclic presentation:
2^9,5|a^2=f,c^2=i,d^2=i,b^a=bf,c^a=cd,c^b=cde,d^a=dg,d^b=dgh,d^c=di,e^a=egh,e^b=egh,e^c=ei,e^d=ei,f^c=fgi,h^c=hi,j^b=j^4124 conjugacy classes — view the full character table.
| maximal subgroup of | D5×#144366 |
| maximal normal subgroup of | D5×#144366 |
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, 3, F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);