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