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