| order | 33488 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D16744 |
| Fitting | C7×C8×C13×C23 ⋊ C2 |
| Hall | C7×C13×C23 ⋊ D8 |
| Hall | C13×C23 ⋊ D56 |
| Hall | C7×C23 ⋊ D104 |
| Hall | C7×C13 ⋊ D184 |
| Sylow | C23 ⋊ D728 |
| Sylow | C13 ⋊ D1288 |
| Sylow | C7 ⋊ D2392 |
88 conjugacy classes of subgroups.
| minimal degree | μ(G) = 51 |
| transitive degree | μt(G) = 16744 |
A minimal faithful permutation representation — 2 generators on 51 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);(2,8)(3,7)(4,6)(10,15)(11,14)(12,13)(17,28)(18,27)(19,26)(20,25)(21,24)(22,23)(30,51)(31,50)(32,49)(33,48)(34,47)(35,46)(36,45)(37,44)(38,43)(39,42)(40,41)Polycyclic presentation:
2^4,7,13,23|b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^6,f^a=f^12,g^a=g^228375 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, 7, 13, 23]);;
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^6);;
gap> SetConjugate(coll, 6, 1, F.6^12);;
gap> SetConjugate(coll, 7, 1, F.7^22);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);