Polynomials with integer coefficients and their zeros

From MaRDI portal



Abstract: We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.


In this paper the author discusses sequences of polynomials with integer coefficients that are restricted in various ways. These ways include having their roots confined to a fixed subset of the complex plane, or their coefficients being bounded by a fixed constant. After a survey of some classical results by Schur and others, some new results are stated and proved. A typical result is the following (Theorem 2.4): If \(P_n(z)\in\mathbb Z[z]\) has degree \(n\) having all its roots distinct and lying in the closed unit disk, and coefficients of modulus at most \(M\), then for \(n\geq \max(M,55)\) its coefficient \(a_{n-1,n}\) of \(z^{n-1}\) has modulus at most \(8M\sqrt{n\log n}\). Other results include bounds for power sums of the roots (Theorem 2.5) and bounds for the modulus of the coefficients of \(z^{n-m}\) for fixed \(m\) (Theorem 2.6). Furthermore, a generalization of the Schur-Siegel-Smyth trace problem is proposed. This concerns finding a lower bound for the mean of the sum of all \(m\)-fold products of distinct roots of a polynomial with integer coefficients having all its roots real and positive.











This page was built for publication: Polynomials with integer coefficients and their zeros

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