| order | 2320 |
| automorphism | Aut(G) order 519680 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic580 |
| Hall | C5×C29 ⋊ Q16 |
| Sylow | C29 ⋊ Dic20 |
| Sylow | C5 ⋊ Dic116 |
36 conjugacy classes of subgroups.
| minimal degree | μ(G) = 50 |
| transitive degree | μt(G) = 2320 |
A minimal faithful permutation representation — 2 generators on 50 points:
(1,2,3,4,5,6,7,8)(9,16,15,14,13,12,11,10)(17,18,19,20,21)(22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,21)(19,20)(23,50)(24,49)(25,48)(26,47)(27,46)(28,45)(29,44)(30,43)(31,42)(32,41)(33,40)(34,39)(35,38)(36,37)Polycyclic presentation:
2^4,5,29|a^2=d,b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^4,f^a=f^28583 conjugacy classes — view the full character table.
| maximal subgroup of | Dic1160, Dic1740, Dic2900, … |
| maximal normal subgroup of | Dic1160 |
| maximal quotient of | Dic1740, Dic2900, Dic4060, … |
Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:
gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 5, 29]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^4);;
gap> SetConjugate(coll, 6, 1, F.6^28);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);