| order | 56592 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic14148 |
| Hall | C27×C131 ⋊ Q16 |
| Sylow | C131 ⋊ Dic108 |
| Sylow | C27 ⋊ Dic524 |
72 conjugacy classes of subgroups.
| minimal degree | μ(G) = 174 |
| transitive degree | μt(G) = 56592 |
A minimal faithful permutation representation — 2 generators on 174 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,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,43)(19,42)(20,41)(21,40)(22,39)(23,38)(24,37)(25,36)(26,35)(27,34)(28,33)(29,32)(30,31)(45,174)(46,173)(47,172)(48,171)(49,170)(50,169)(51,168)(52,167)(53,166)(54,165)(55,164)(56,163)(57,162)(58,161)(59,160)(60,159)(61,158)(62,157)(63,156)(64,155)(65,154)(66,153)(67,152)(68,151)(69,150)(70,149)(71,148)(72,147)(73,146)(74,145)(75,144)(76,143)(77,142)(78,141)(79,140)(80,139)(81,138)(82,137)(83,136)(84,135)(85,134)(86,133)(87,132)(88,131)(89,130)(90,129)(91,128)(92,127)(93,126)(94,125)(95,124)(96,123)(97,122)(98,121)(99,120)(100,119)(101,118)(102,117)(103,116)(104,115)(105,114)(106,113)(107,112)(108,111)(109,110)Polycyclic presentation:
2^4,3,131,3^2|a^2=d,b^2=cd,c^2=d,e^3=g,g^3=h,b^a=bc,c^a=cd,e^a=e^2g^2h^2,f^a=f^130,g^a=g^2h^2,h^a=h^214151 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, 131, 3, 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.7);;
gap> SetPower(coll, 7, 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.7^2*F.8^2);;
gap> SetConjugate(coll, 6, 1, F.6^130);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.8^2);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);