| order | 56848 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D28424 |
| Fitting | C8×C11×C17×C19 ⋊ C2 |
| Hall | C11×C17×C19 ⋊ D8 |
| Hall | C17×C19 ⋊ D88 |
| Hall | C11×C19 ⋊ D136 |
| Hall | C11×C17 ⋊ D152 |
| Sylow | C19 ⋊ D1496 |
| Sylow | C17 ⋊ D1672 |
| Sylow | C11 ⋊ D2584 |
88 conjugacy classes of subgroups.
| minimal degree | μ(G) = 55 |
| transitive degree | μt(G) = 28424 |
A minimal faithful permutation representation — 2 generators on 55 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);(2,8)(3,7)(4,6)(10,19)(11,18)(12,17)(13,16)(14,15)(21,36)(22,35)(23,34)(24,33)(25,32)(26,31)(27,30)(28,29)(38,55)(39,54)(40,53)(41,52)(42,51)(43,50)(44,49)(45,48)(46,47)Polycyclic presentation:
2^4,11,17,19|b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^10,f^a=f^16,g^a=g^1814215 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, 11, 17, 19]);;
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^10);;
gap> SetConjugate(coll, 6, 1, F.6^16);;
gap> SetConjugate(coll, 7, 1, F.7^18);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);