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