The Integer Chebyshev Problem is a problem in computational number theory that asks us to find a polynomial \(p(x)\) with integer coefficients that is small on an interval, say \([0,1]\). By small, we mean that its largest absolute value is small.
I did some computational experiments and research on this problem under the supervision of Kevin Hare. That research was published, and can be found here. The arXiv version is available here, though there are some minor changes that haven’t been made yet.
There were a lot of data files that I intended on putting up somewhere associated with this project, and I haven’t yet done so. If you’re interested in them, send me an email.