| order | 9408 |
| automorphism | Aut(G) order 6322176 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic2352 |
| Hall | C3×C49 ⋊ Q64 |
| Sylow | C49 ⋊ Dic48 |
| Sylow | C3 ⋊ Dic784 |
90 conjugacy classes of subgroups.
| minimal degree | μ(G) = 116 |
| transitive degree | μt(G) = 9408 |
A minimal faithful permutation representation — 2 generators on 116 points:
(1,2,3,4,5,6,7,8,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,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34)(65,66,67)(68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116);(1,33,17,49)(2,34,18,50)(3,35,19,51)(4,36,20,52)(5,37,21,53)(6,38,22,54)(7,39,23,55)(8,40,24,56)(9,41,25,57)(10,42,26,58)(11,43,27,59)(12,44,28,60)(13,45,29,61)(14,46,30,62)(15,47,31,63)(16,48,32,64)(66,67)(69,116)(70,115)(71,114)(72,113)(73,112)(74,111)(75,110)(76,109)(77,108)(78,107)(79,106)(80,105)(81,104)(82,103)(83,102)(84,101)(85,100)(86,99)(87,98)(88,97)(89,96)(90,95)(91,94)(92,93)Polycyclic presentation:
2^6,3,7^2|a^2=f,b^2=cd,c^2=de,d^2=ef,e^2=f,h^7=i,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2,h^a=h^6i^6,i^a=i^62355 conjugacy classes. The character table is too large to display.
| maximal subgroup of | Dic4704, Dic7056, Dic11760 |
| maximal normal subgroup of | Dic4704 |
| maximal quotient of | Dic7056, Dic11760 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 7, 7]);;
gap> SetPower(coll, 1, F.6);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> SetConjugate(coll, 8, 1, F.8^6*F.9^6);;
gap> SetConjugate(coll, 9, 1, F.9^6);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);