| order | 48112 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic12028 |
| Hall | C31×C97 ⋊ Q16 |
| Sylow | C97 ⋊ Dic124 |
| Sylow | C31 ⋊ Dic388 |
36 conjugacy classes of subgroups.
| minimal degree | μ(G) = 144 |
| transitive degree | μt(G) = 48112 |
A minimal faithful permutation representation — 2 generators on 144 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,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,47)(19,46)(20,45)(21,44)(22,43)(23,42)(24,41)(25,40)(26,39)(27,38)(28,37)(29,36)(30,35)(31,34)(32,33)(49,144)(50,143)(51,142)(52,141)(53,140)(54,139)(55,138)(56,137)(57,136)(58,135)(59,134)(60,133)(61,132)(62,131)(63,130)(64,129)(65,128)(66,127)(67,126)(68,125)(69,124)(70,123)(71,122)(72,121)(73,120)(74,119)(75,118)(76,117)(77,116)(78,115)(79,114)(80,113)(81,112)(82,111)(83,110)(84,109)(85,108)(86,107)(87,106)(88,105)(89,104)(90,103)(91,102)(92,101)(93,100)(94,99)(95,98)(96,97)Polycyclic presentation:
2^4,31,97|a^2=d,b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^30,f^a=f^9612031 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 31, 97]);;
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^30);;
gap> SetConjugate(coll, 6, 1, F.6^96);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);