Abstract
We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval [0, 1]. We implement algorithms from semi-infinite programing and a branch and bound algorithm to improve on previous methods for finding integer Chebyshev polynomials of degree n. Using our new method, we found 16 new integer Chebyshev polynomials of degrees in the range 147 to 244.
Mathematics Subject Classification:
Disclosure statement
No potential conflict of interest was reported by the authors.