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