On monogeneity of reciprocal polynomials

From MaRDI portal





A monic, integer and irreducible polynomial is called monogenic if the number field, generated by a root of this polynomial, is monogenic. An integer polynomial \(f(x)\) of degree \(d\) is called reciprocal if \(f(x)=x^d\cdot f(1/x)\). It is well-known (see, e.g., Proposition 3.2 in [\textit{P. Alexandersson} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.56, 36 p. (2021; Zbl 1461.05235)]) that any reciprocal polynomial \(f(x)=\sum_{j=0}^{2n}a_jx^j\) of degree \(2n\) with integer coefficients can be expressed as \(f(x)=x^ng(x+x^{-1})\), where \(g(u)=a_n+2\sum_{j=1}^{n}a_{n-j}T_j(u/2)\) is an integer polynomial of degree \(n\) and \(T_j(x)\) are Chebyshev polynomials of the first kind. Authors study reciprocal monogenic polynomials. They proved that a monic, irreducible, integer and reciprocal polynomial \(f(x)\) of degree \(2n\), \(n\geq 2\), is monogenic, provided \(f(-1)f(1)\) is squarefree and \(g(x)\) is monogenic. They also prove a partial convers of this statemant, i.e., if \(g(x)\) is not monogenic, then so is \(f(x)\).\N\N\textit{L. Jones} [New York J. Math. 27, 1465--1493 (2021; Zbl 1487.11096)] investigated monogeneity of polynomials, obtained from a cyclotomic polynomial by perturbing its middle coefficient. He conjectured explicit expression of the discriminant of such polynomials. This conjecture was partially proved by the authors. Also, authors, motivated by the work of \textit{A. Jakhar} et al. [Ramanujan J. 67, No. 3, Paper No. 69, 9 p. (2025; Zbl 1573.11344)], establish a lower bound on the number of certain sextic monogenic reciprocal polynomials.











This page was built for publication: On monogeneity of reciprocal polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851013)