| order | 59568 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic14892 |
| Hall | C3×C17×C73 ⋊ Q16 |
| Hall | C17×C73 ⋊ Dic12 |
| Hall | C3×C73 ⋊ Dic68 |
| Sylow | C73 ⋊ Dic204 |
| Hall | C3×C17 ⋊ Dic292 |
| Sylow | C17 ⋊ Dic876 |
| Sylow | C3 ⋊ Dic4964 |
72 conjugacy classes of subgroups.
| minimal degree | μ(G) = 109 |
| transitive degree | μt(G) = 59568 |
A minimal faithful permutation representation — 2 generators on 109 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,51,52,53,54,55,56,57,58,59,60,61,62,63,64,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);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,19)(21,36)(22,35)(23,34)(24,33)(25,32)(26,31)(27,30)(28,29)(38,109)(39,108)(40,107)(41,106)(42,105)(43,104)(44,103)(45,102)(46,101)(47,100)(48,99)(49,98)(50,97)(51,96)(52,95)(53,94)(54,93)(55,92)(56,91)(57,90)(58,89)(59,88)(60,87)(61,86)(62,85)(63,84)(64,83)(65,82)(66,81)(67,80)(68,79)(69,78)(70,77)(71,76)(72,75)(73,74)Polycyclic presentation:
2^4,3,17,73|a^2=d,b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^2,f^a=f^16,g^a=g^7214895 conjugacy classes. The character table is too large to display.
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, 73]);;
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^2);;
gap> SetConjugate(coll, 6, 1, F.6^16);;
gap> SetConjugate(coll, 7, 1, F.7^72);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);