| order | 45504 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic11376 |
| Hall | C9×C79 ⋊ Q64 |
| Sylow | C79 ⋊ Dic144 |
| Sylow | C9 ⋊ Dic1264 |
90 conjugacy classes of subgroups.
| minimal degree | μ(G) = 152 |
| transitive degree | μt(G) = 45504 |
A minimal faithful permutation representation — 2 generators on 152 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,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,145,146,147,148,149,150,151,152);(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,73)(67,72)(68,71)(69,70)(75,152)(76,151)(77,150)(78,149)(79,148)(80,147)(81,146)(82,145)(83,144)(84,143)(85,142)(86,141)(87,140)(88,139)(89,138)(90,137)(91,136)(92,135)(93,134)(94,133)(95,132)(96,131)(97,130)(98,129)(99,128)(100,127)(101,126)(102,125)(103,124)(104,123)(105,122)(106,121)(107,120)(108,119)(109,118)(110,117)(111,116)(112,115)(113,114)Polycyclic presentation:
2^6,3,79,3|a^2=f,b^2=cd,c^2=de,d^2=ef,e^2=f,g^3=i,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2i^2,h^a=h^78,i^a=i^211379 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", "i");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 79, 3]);;
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, 7, 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*F.9^2);;
gap> SetConjugate(coll, 8, 1, F.8^78);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);