| order | 59072 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D29536 |
| Fitting | C13×C32×C71 ⋊ C2 |
| Hall | C13×C71 ⋊ D32 |
| Sylow | C71 ⋊ D416 |
| Sylow | C13 ⋊ D2272 |
68 conjugacy classes of subgroups.
| minimal degree | μ(G) = 116 |
| transitive degree | μt(G) = 29536 |
A minimal faithful permutation representation — 2 generators on 116 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,103,104,105,106,107,108,109,110,111,112,113,114,115,116);(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,45)(35,44)(36,43)(37,42)(38,41)(39,40)(47,116)(48,115)(49,114)(50,113)(51,112)(52,111)(53,110)(54,109)(55,108)(56,107)(57,106)(58,105)(59,104)(60,103)(61,102)(62,101)(63,100)(64,99)(65,98)(66,97)(67,96)(68,95)(69,94)(70,93)(71,92)(72,91)(73,90)(74,89)(75,88)(76,87)(77,86)(78,85)(79,84)(80,83)(81,82)Polycyclic presentation:
2^6,13,71|b^2=cd,c^2=de,d^2=ef,e^2=f,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^12,h^a=h^7014771 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 13, 71]);;
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> 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^12);;
gap> SetConjugate(coll, 8, 1, F.8^70);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);