| order | 17160 |
| automorphism | Aut(G) order 16473600 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D8580 |
128 conjugacy classes of subgroups.
| minimal degree | μ(G) = 36 |
| transitive degree | μt(G) = 8580 |
A minimal faithful permutation representation — 2 generators on 36 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);(2,4)(6,7)(9,12)(10,11)(14,23)(15,22)(16,21)(17,20)(18,19)(25,36)(26,35)(27,34)(28,33)(29,32)(30,31)Polycyclic presentation:
2^3,3,5,11,13|b^2=c,b^a=bc,d^a=d^2,e^a=e^4,f^a=f^10,g^a=g^124293 conjugacy classes. The character table is too large to display.
| maximal subgroup of | D17160, D25740 |
| maximal normal subgroup of | D17160 |
| maximal quotient of | Dic8580, D17160, D25740 |
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, 3, 5, 11, 13]);;
gap> SetPower(coll, 2, F.3);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.5^4);;
gap> SetConjugate(coll, 6, 1, F.6^10);;
gap> SetConjugate(coll, 7, 1, F.7^12);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);