Monogenic Even Octic Polynomials and Their Galois Groups
Abstract: A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and ${1,\theta,\theta2,\ldots ,\theta{N-1}}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where $f(\theta)=0$. In a series of recent articles, complete classifications of the Galois groups were given for irreducible polynomials [{\mathcal F}(x):=x8+ax4+b\in {\mathbb Z}[x]] and [{\mathcal G}(x):=x8+ax6+bx4+ax2+1\in {\mathbb Z}[x], \quad a\ne 0.] In this article, for each Galois group $G$ arising in these classifications, we either construct an infinite family of monogenic octic polynomials ${\mathcal F}(x)$ or ${\mathcal G}(x)$ having Galois group $G$, or we prove that at most a finite such family exists. In the finite family situations, we determine all such polynomials. Here, a ``family" means that no two polynomials in the family generate isomorphic octic fields.
- T. Dokchitser, https://people.maths.bris.ac.uk/~matyd/GroupNames/T31.html
- J. Harrington and L. Jones. The irreducibility and monogenicity of power-compostional trinomials, Math. J. Okayama Univ. (to appear).
- J. Harrington and L. Jones. Monogenic quartic polynomials and their Galois groups, arXiv:2404.05487v3.
- K. Kedlaya, A construction of polynomials with squarefree discriminants,
- J. Klüners and G. Malle, http://galoisdb.math.upb.de/home.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.