Search arXivSearch

arXiv · math/0101166

Small polynomials with integer coefficients

Abstract

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of positive capacity in this case. We also find the first nontrivial examples of explicit integer Chebyshev constants for certain classes of lemniscates. Since it is rarely possible to obtain an exact value of integer Chebyshev constant, good estimates are of special importance. Introducing the methods of weighted potential theory, we generalize and improve the Hilbert-Fekete upper bound for integer Chebyshev constant. These methods also give bounds for the multiplicities of factors of integer Chebyshev polynomials, and lower bounds for integer Chebyshev constant. Moreover, all the mentioned bounds can be found numerically, by using various extremal point techniques, such as weighted Leja points algorithm. Applying our results in the classical case of the segment $[0,1]$, we improve the known bounds for the integer Chebyshev constant and the multiplicities of factors of the integer Chebyshev polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor E. Pritsker. 2001-01-20. Small polynomials with integer coefficients. https://arxiv.org/abs/math/0101166

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Regular specular differentiation in Euclidean spaces

We study the regular specular derivative, a generalized derivative defined at every point where both one-sided derivatives exist and are finite. Geometrically, it is the slope of the mirror that reflects the left tangent ray into the right one. In one variable we derive computational formulas, prove inverse function and rotation rules, establish Quasi-Rolle's Theorem and the Quasi-Mean Value Theorem, and obtain a derivative-limit theorem, which shows that twice regularly specularly differentiable functions are continuously differentiable. We also prove both parts of the Fundamental Theorem of Calculus. In several variables we introduce specular gradients, directional derivatives, tangent hyperplanes, and normal vectors, show that a continuous specular gradient forces classical differentiability, and characterize when the specular tangent hyperplane is unique.

math.CA

Prevalent smoothness in inhomogeneous Besov spaces

In this article, we prove that, under some assumptions on the so-called environment, prevalent functions in inhomogeneous Besov spaces recently introduced by Barral-Seuret in 2023 are multifractal, with a singularity spectrum that we determine. This completes the previous Baire generic results already obtained.

math.CA

Lebesgue Covering Theorem and level sets of continuous functions

We formulate and prove a dimension-theoretic generalization of a version of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved algorithmically by Turzański and Ziajor, is a particular case of this result. Moreover, we study two types of sets associated with a continuous function $g \colon [0,1]^n \to \mathbb{R}$. Namely, the set of all points $p \in \mathbb{R}$ such that the fiber $g^{-1}[\left\{p\right\}]$ connects $i$th opposite faces of $[0,1]^n$, and the set of all points $p \in \mathbb{R}$ such that the fiber $g^{-1}[\left\{p\right\}]$ separates $i$th opposite faces of $[0, 1]^n$.

math.CA