| order | 4680 |
| automorphism | Aut(G) order 1347840 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic1170 |
| Hall | C5×C9×C13 ⋊ Q8 |
| Hall | C9×C13 ⋊ Dic10 |
| Hall | C5×C13 ⋊ Dic18 |
| Hall | C5×C9 ⋊ Dic26 |
| Sylow | C13 ⋊ Dic90 |
| Sylow | C9 ⋊ Dic130 |
| Sylow | C5 ⋊ Dic234 |
72 conjugacy classes of subgroups.
| minimal degree | μ(G) = 35 |
| transitive degree | μt(G) = 4680 |
A minimal faithful permutation representation — 2 generators on 35 points:
(1,2,3,4)(5,8,7,6)(9,10,11,12,13,14,15,16,17)(18,19,20,21,22)(23,24,25,26,27,28,29,30,31,32,33,34,35);(1,5,3,7)(2,6,4,8)(10,17)(11,16)(12,15)(13,14)(19,22)(20,21)(24,35)(25,34)(26,33)(27,32)(28,31)(29,30)Polycyclic presentation:
2^3,3,5,13,3|a^2=c,b^2=c,d^3=g,b^a=bc,d^a=d^2g^2,e^a=e^4,f^a=f^12,g^a=g^21173 conjugacy classes. The character table is too large to display.
| maximal subgroup of | Dic2340, Dic3510, Dic5850, … |
| maximal normal subgroup of | Dic2340 |
| maximal quotient of | Dic3510, Dic5850, Dic8190, … |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 5, 13, 3]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 2, F.3);;
gap> SetPower(coll, 4, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^2*F.7^2);;
gap> SetConjugate(coll, 5, 1, F.5^4);;
gap> SetConjugate(coll, 6, 1, F.6^12);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);