Finite Group DatabasebetaFinite Group Databasebeta| order | 62832 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic15708 |
144 conjugacy classes of subgroups; only the 67 normal subgroups are shown.
This group has 144 conjugacy classes of subgroups — too many to draw. Only its 67 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 54 |
| transitive degree | μt(G) = 62832 |
A minimal faithful permutation representation — 2 generators on 54 points:
(1,2,3,4,5,6,7,8)(9,16,15,14,13,12,11,10)(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);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,19)(21,26)(22,25)(23,24)(28,37)(29,36)(30,35)(31,34)(32,33)(39,54)(40,53)(41,52)(42,51)(43,50)(44,49)(45,48)(46,47)Polycyclic presentation:
2^4,3,7,11,17|a^2=d,b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^2,f^a=f^6,g^a=g^10,h^a=h^1615711 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, 3, 7, 11, 17]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> SetConjugate(coll, 6, 1, F.6^6);;
gap> SetConjugate(coll, 7, 1, F.7^10);;
gap> SetConjugate(coll, 8, 1, F.8^16);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);