| order | 52360 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D26180 |
128 conjugacy classes of subgroups.
| minimal degree | μ(G) = 44 |
| transitive degree | μt(G) = 26180 |
A minimal faithful permutation representation — 2 generators on 44 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);(2,4)(6,9)(7,8)(11,16)(12,15)(13,14)(18,27)(19,26)(20,25)(21,24)(22,23)(29,44)(30,43)(31,42)(32,41)(33,40)(34,39)(35,38)(36,37)Polycyclic presentation:
2^3,5,7,11,17|b^2=c,b^a=bc,d^a=d^4,e^a=e^6,f^a=f^10,g^a=g^1613093 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, 5, 7, 11, 17]);;
gap> SetPower(coll, 2, F.3);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^4);;
gap> SetConjugate(coll, 5, 1, F.5^6);;
gap> SetConjugate(coll, 6, 1, F.6^10);;
gap> SetConjugate(coll, 7, 1, F.7^16);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);