Polynomials whose roots and critical points are integers

arXivmath/0407256MaRDI QIDQ6474252FDOQ6474252

Publication date: 14 July 2004

Abstract: Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring of rational integers to rings of algebraic integers that are unique factorization domains, with special interest in the ring of Gaussian integers. We apply our method to establish strong properties of nice polynomials whose degree is a prime power. We present a considerable reduction of the system of equations for nice polynomials of arbitrary degree with three roots. We establish properties of nice antisymmetric polynomials, and properties of the averages of the roots of the derivatives of nice polynomials. Finally, we present new examples of nice polynomials obtained with the help of a computer, after a considerable simplification of the computation by our method.

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Cubic and quartic Diophantine equations (11D25) Higher degree equations; Fermat's equation (11D41) Diophantine equations in many variables (11D72)

This page was built for publication: Polynomials whose roots and critical points are integers

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