| order | 64288 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D32144 |
| Fitting | C16×C41×C49 ⋊ C2 |
| Hall | C41×C49 ⋊ D16 |
| Sylow | C49 ⋊ D656 |
| Sylow | C41 ⋊ D784 |
84 conjugacy classes of subgroups.
| minimal degree | μ(G) = 106 |
| transitive degree | μt(G) = 32144 |
A minimal faithful permutation representation — 2 generators on 106 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);(2,16)(3,15)(4,14)(5,13)(6,12)(7,11)(8,10)(18,65)(19,64)(20,63)(21,62)(22,61)(23,60)(24,59)(25,58)(26,57)(27,56)(28,55)(29,54)(30,53)(31,52)(32,51)(33,50)(34,49)(35,48)(36,47)(37,46)(38,45)(39,44)(40,43)(41,42)(67,106)(68,105)(69,104)(70,103)(71,102)(72,101)(73,100)(74,99)(75,98)(76,97)(77,96)(78,95)(79,94)(80,93)(81,92)(82,91)(83,90)(84,89)(85,88)(86,87)Polycyclic presentation:
2^5,7,41,7|b^2=cd,c^2=de,d^2=e,f^7=h,b^a=bc,c^a=cd,d^a=de,f^a=f^6h^6,g^a=g^40,h^a=h^616075 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, 2, 7, 41, 7]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5);;
gap> SetPower(coll, 6, F.8);;
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, 6, 1, F.6^6*F.8^6);;
gap> SetConjugate(coll, 7, 1, F.7^40);;
gap> SetConjugate(coll, 8, 1, F.8^6);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);