| order | 55272 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic13818 |
| Hall | C3×C47×C49 ⋊ Q8 |
| Hall | C47×C49 ⋊ Dic6 |
| Hall | C3×C49 ⋊ Dic94 |
| Hall | C3×C47 ⋊ Dic98 |
| Sylow | C49 ⋊ Dic282 |
| Sylow | C47 ⋊ Dic294 |
| Sylow | C3 ⋊ Dic4606 |
72 conjugacy classes of subgroups.
| minimal degree | μ(G) = 107 |
| transitive degree | μt(G) = 55272 |
A minimal faithful permutation representation — 2 generators on 107 points:
(1,2,3,4)(5,8,7,6)(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);(1,5,3,7)(2,6,4,8)(10,11)(13,60)(14,59)(15,58)(16,57)(17,56)(18,55)(19,54)(20,53)(21,52)(22,51)(23,50)(24,49)(25,48)(26,47)(27,46)(28,45)(29,44)(30,43)(31,42)(32,41)(33,40)(34,39)(35,38)(36,37)(62,107)(63,106)(64,105)(65,104)(66,103)(67,102)(68,101)(69,100)(70,99)(71,98)(72,97)(73,96)(74,95)(75,94)(76,93)(77,92)(78,91)(79,90)(80,89)(81,88)(82,87)(83,86)(84,85)Polycyclic presentation:
2^3,3,7,47,7|a^2=c,b^2=c,e^7=g,b^a=bc,d^a=d^2,e^a=e^6g^6,f^a=f^46,g^a=g^613821 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, 47, 7]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 2, F.3);;
gap> SetPower(coll, 5, F.7);;
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*F.7^6);;
gap> SetConjugate(coll, 6, 1, F.6^46);;
gap> SetConjugate(coll, 7, 1, F.7^6);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);