| order | 61488 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic15372 |
| Hall | C7×C9×C61 ⋊ Q16 |
| Hall | C9×C61 ⋊ Dic28 |
| Hall | C7×C61 ⋊ Dic36 |
| Hall | C7×C9 ⋊ Dic244 |
| Sylow | C61 ⋊ Dic252 |
| Sylow | C9 ⋊ Dic1708 |
| Sylow | C7 ⋊ Dic2196 |
108 conjugacy classes of subgroups.
| minimal degree | μ(G) = 93 |
| transitive degree | μt(G) = 61488 |
A minimal faithful permutation representation — 2 generators on 93 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);(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,32)(28,31)(29,30)(34,93)(35,92)(36,91)(37,90)(38,89)(39,88)(40,87)(41,86)(42,85)(43,84)(44,83)(45,82)(46,81)(47,80)(48,79)(49,78)(50,77)(51,76)(52,75)(53,74)(54,73)(55,72)(56,71)(57,70)(58,69)(59,68)(60,67)(61,66)(62,65)(63,64)Polycyclic presentation:
2^4,3,7,61,3|a^2=d,b^2=cd,c^2=d,e^3=h,b^a=bc,c^a=cd,e^a=e^2h^2,f^a=f^6,g^a=g^60,h^a=h^215375 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", "h");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 7, 61, 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.8);;
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.8^2);;
gap> SetConjugate(coll, 6, 1, F.6^6);;
gap> SetConjugate(coll, 7, 1, F.7^60);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);