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