| order | 2448 |
| automorphism | Aut(G) order 470016 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic612 |
| Hall | C9×C17 ⋊ Q16 |
| Sylow | C17 ⋊ Dic36 |
| Sylow | C9 ⋊ Dic68 |
54 conjugacy classes of subgroups.
| minimal degree | μ(G) = 42 |
| transitive degree | μt(G) = 2448 |
A minimal faithful permutation representation — 2 generators on 42 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);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,25)(19,24)(20,23)(21,22)(27,42)(28,41)(29,40)(30,39)(31,38)(32,37)(33,36)(34,35)Polycyclic presentation:
2^4,3,17,3|a^2=d,b^2=cd,c^2=d,e^3=g,b^a=bc,c^a=cd,e^a=e^2g^2,f^a=f^16,g^a=g^2615 conjugacy classes — view the full character table.
| maximal subgroup of | Dic1224, Dic1836, Dic3060, … |
| maximal normal subgroup of | Dic1224 |
| maximal quotient of | Dic1836, Dic3060, Dic4284, … |
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, 2, 3, 17, 3]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.7);;
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^2*F.7^2);;
gap> SetConjugate(coll, 6, 1, F.6^16);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);