| order | 53072 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D26536 |
| Fitting | C8×C31×C107 ⋊ C2 |
| Hall | C31×C107 ⋊ D8 |
| Sylow | C107 ⋊ D248 |
| Sylow | C31 ⋊ D856 |
44 conjugacy classes of subgroups.
| minimal degree | μ(G) = 146 |
| transitive degree | μt(G) = 26536 |
A minimal faithful permutation representation — 2 generators on 146 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);(2,8)(3,7)(4,6)(10,39)(11,38)(12,37)(13,36)(14,35)(15,34)(16,33)(17,32)(18,31)(19,30)(20,29)(21,28)(22,27)(23,26)(24,25)(41,146)(42,145)(43,144)(44,143)(45,142)(46,141)(47,140)(48,139)(49,138)(50,137)(51,136)(52,135)(53,134)(54,133)(55,132)(56,131)(57,130)(58,129)(59,128)(60,127)(61,126)(62,125)(63,124)(64,123)(65,122)(66,121)(67,120)(68,119)(69,118)(70,117)(71,116)(72,115)(73,114)(74,113)(75,112)(76,111)(77,110)(78,109)(79,108)(80,107)(81,106)(82,105)(83,104)(84,103)(85,102)(86,101)(87,100)(88,99)(89,98)(90,97)(91,96)(92,95)(93,94)Polycyclic presentation:
2^4,31,107|b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^30,f^a=f^10613271 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 31, 107]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
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^30);;
gap> SetConjugate(coll, 6, 1, F.6^106);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);