| order | 63840 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic15960 |
192 conjugacy classes of subgroups; only the 83 normal subgroups are shown.
This group has 192 conjugacy classes of subgroups — too many to draw. Only its 83 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 66 |
| transitive degree | μt(G) = 63840 |
A minimal faithful permutation representation — 2 generators on 66 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);(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,35)(37,40)(38,39)(42,47)(43,46)(44,45)(49,66)(50,65)(51,64)(52,63)(53,62)(54,61)(55,60)(56,59)(57,58)Polycyclic presentation:
2^5,3,5,7,19|a^2=e,b^2=cd,c^2=de,d^2=e,b^a=bc,c^a=cd,d^a=de,f^a=f^2,g^a=g^4,h^a=h^6,i^a=i^1815963 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, 5, 7, 19]);;
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> 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);;
gap> SetConjugate(coll, 7, 1, F.7^4);;
gap> SetConjugate(coll, 8, 1, F.8^6);;
gap> SetConjugate(coll, 9, 1, F.9^18);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);