The integer Chebyshev problem

We are concerned with the problem of minimizing the supremum norm on an interval of a nonzero polynomial of degree at mostnnwith integer coefficients. This is an old and hard problem that cannot be exactly solved in any nontrivial cases. We examine the case of the interval[0,1][0,1]in most detail. H... View More