← Prev (#72271989) Next (#72271991) →
D15276 #72271990
Aliases
Splittings
Subgroups
64 conjugacy classes of subgroups.
Full subgroup data →
Presentation
A minimal faithful permutation representation — 2 generators on 93 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,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93);(2,4)(6,7)(9,26)(10,25)(11,24)(12,23)(13,22)(14,21)(15,20)(16,19)(17,18)(28,93)(29,92)(30,91)(31,90)(32,89)(33,88)(34,87)(35,86)(36,85)(37,84)(38,83)(39,82)(40,81)(41,80)(42,79)(43,78)(44,77)(45,76)(46,75)(47,74)(48,73)(49,72)(50,71)(51,70)(52,69)(53,68)(54,67)(55,66)(56,65)(57,64)(58,63)(59,62)(60,61)
Polycyclic presentation:
2^3,3,19,67|b^2=c,b^a=bc,d^a=d^2,e^a=e^18,f^a=f^66
Conjugacy classes & character table
7641 conjugacy classes. The character table is too large to display.
Relationships
GAP
Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:
gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 19, 67]);;
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^18);;
gap> SetConjugate(coll, 6, 1, F.6^66);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);