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