Analysis In Different Phases, Formulas and Conditions of Integer Coefficients Polynomials |
We study the problem of minimizingthe supremum norm, on a segment of the real line or on a compact set in theplane, by polynomials with integer coefficients. The extremal polynomials arenaturally called integer Chebyshev polynomials. Their factors, zerodistribution and asymptotics are the main subjects of this paper. Inparticular, we show that the integer Chebyshev polynomials for any infinitesubset of the real line must have infinitely many distinct factors, whichanswers a question of Borwein and Erdelyi. Furthermore, it is proved that theaccumulation set for their zeros must be of positive capacity in this case. Wealso find the first nontrivial examples of explicit integer Chebyshev constantsfor certain classes of lemniscates.