| order | 35136 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D17568 |
| Fitting | C9×C32×C61 ⋊ C2 |
| Hall | C9×C61 ⋊ D32 |
| Sylow | C61 ⋊ D288 |
| Sylow | C9 ⋊ D1952 |
102 conjugacy classes of subgroups.
| minimal degree | μ(G) = 102 |
| transitive degree | μt(G) = 17568 |
A minimal faithful permutation representation — 2 generators on 102 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,94,95,96,97,98,99,100,101,102);(2,32)(3,31)(4,30)(5,29)(6,28)(7,27)(8,26)(9,25)(10,24)(11,23)(12,22)(13,21)(14,20)(15,19)(16,18)(34,41)(35,40)(36,39)(37,38)(43,102)(44,101)(45,100)(46,99)(47,98)(48,97)(49,96)(50,95)(51,94)(52,93)(53,92)(54,91)(55,90)(56,89)(57,88)(58,87)(59,86)(60,85)(61,84)(62,83)(63,82)(64,81)(65,80)(66,79)(67,78)(68,77)(69,76)(70,75)(71,74)(72,73)Polycyclic presentation:
2^6,3,61,3|b^2=cd,c^2=de,d^2=ef,e^2=f,g^3=i,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2i^2,h^a=h^60,i^a=i^28787 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", "h", "i");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 61, 3]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.9^2);;
gap> SetConjugate(coll, 8, 1, F.8^60);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);