arXiv · 1804.05985
Applications of Integer and Semi-Infinite Programming to the Integer Chebyshev Problem
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 programming 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.
Explore related subjects
Keep this discovery
Kevin G. Hare, Philip W. Hodges. 2018-04-16. Applications of Integer and Semi-Infinite Programming to the Integer Chebyshev Problem. https://arxiv.org/abs/1804.05985
Cite the original work for its findings. Save a collection to share your selection of sources.