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