| order | 50880 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D25440 |
| Fitting | C3×C5×C32×C53 ⋊ C2 |
| Hall | C3×C5×C53 ⋊ D32 |
| Hall | C5×C53 ⋊ D96 |
| Hall | C3×C53 ⋊ D160 |
| Sylow | C53 ⋊ D480 |
| Hall | C3×C5 ⋊ D1696 |
| Sylow | C5 ⋊ D5088 |
| Sylow | C3 ⋊ D8480 |
136 conjugacy classes of subgroups.
| minimal degree | μ(G) = 93 |
| transitive degree | μt(G) = 25440 |
A minimal faithful permutation representation — 2 generators on 93 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);(2,32)(3,31)(4,30)(5,29)(6,28)(7,27)(8,26)(9,25)(10,24)(11,23)(12,22)(13,21)(14,20)(15,19)(16,18)(34,35)(37,40)(38,39)(42,93)(43,92)(44,91)(45,90)(46,89)(47,88)(48,87)(49,86)(50,85)(51,84)(52,83)(53,82)(54,81)(55,80)(56,79)(57,78)(58,77)(59,76)(60,75)(61,74)(62,73)(63,72)(64,71)(65,70)(66,69)(67,68)Polycyclic presentation:
2^6,3,5,53|b^2=cd,c^2=de,d^2=ef,e^2=f,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2,h^a=h^4,i^a=i^5212723 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", "i");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 5, 53]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> SetConjugate(coll, 8, 1, F.8^4);;
gap> SetConjugate(coll, 9, 1, F.9^52);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);