| order | 59160 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D29580 |
128 conjugacy classes of subgroups.
| minimal degree | μ(G) = 58 |
| transitive degree | μt(G) = 29580 |
A minimal faithful permutation representation — 2 generators on 58 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);(2,4)(6,7)(9,12)(10,11)(14,29)(15,28)(16,27)(17,26)(18,25)(19,24)(20,23)(21,22)(31,58)(32,57)(33,56)(34,55)(35,54)(36,53)(37,52)(38,51)(39,50)(40,49)(41,48)(42,47)(43,46)(44,45)Polycyclic presentation:
2^3,3,5,17,29|b^2=c,b^a=bc,d^a=d^2,e^a=e^4,f^a=f^16,g^a=g^2814793 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, 3, 5, 17, 29]);;
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^16);;
gap> SetConjugate(coll, 7, 1, F.7^28);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);