| order | 20928 |
| automorphism | Aut(G) order 36163584 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic5232 |
| Hall | C3×C109 ⋊ Q64 |
| Sylow | C109 ⋊ Dic48 |
| Sylow | C3 ⋊ Dic1744 |
60 conjugacy classes of subgroups.
| minimal degree | μ(G) = 176 |
| transitive degree | μt(G) = 20928 |
A minimal faithful permutation representation — 2 generators on 176 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,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176);(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,67)(69,176)(70,175)(71,174)(72,173)(73,172)(74,171)(75,170)(76,169)(77,168)(78,167)(79,166)(80,165)(81,164)(82,163)(83,162)(84,161)(85,160)(86,159)(87,158)(88,157)(89,156)(90,155)(91,154)(92,153)(93,152)(94,151)(95,150)(96,149)(97,148)(98,147)(99,146)(100,145)(101,144)(102,143)(103,142)(104,141)(105,140)(106,139)(107,138)(108,137)(109,136)(110,135)(111,134)(112,133)(113,132)(114,131)(115,130)(116,129)(117,128)(118,127)(119,126)(120,125)(121,124)(122,123)Polycyclic presentation:
2^6,3,109|a^2=f,b^2=cd,c^2=de,d^2=ef,e^2=f,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2,h^a=h^1085235 conjugacy classes. The character table is too large to display.
| maximal subgroup of | Dic10464, Dic15696 |
| maximal normal subgroup of | Dic10464 |
| maximal quotient of | Dic15696 |
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, 2, 2, 3, 109]);;
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> 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);;
gap> SetConjugate(coll, 8, 1, F.8^108);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);