Finite Group DatabasebetaFinite Group Databasebeta| order | 62832 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D31416 |
176 conjugacy classes of subgroups; only the 67 normal subgroups are shown.
This group has 176 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) = 46 |
| transitive degree | μt(G) = 31416 |
A minimal faithful permutation representation — 2 generators on 46 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);(2,8)(3,7)(4,6)(10,11)(13,18)(14,17)(15,16)(20,29)(21,28)(22,27)(23,26)(24,25)(31,46)(32,45)(33,44)(34,43)(35,42)(36,41)(37,40)(38,39)Polycyclic presentation:
2^4,3,7,11,17|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, 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);