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