Monic integer Chebyshev problem
Published in Mathematics of Computation • Jan 8, 2003
NobleIDNI3P58W11R49S75
Authors:,,
Peter Borwein
Christopher Pinner
Igor E. Pritsker
Abstract
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let $\mathcal {M}_n({\mathbb {Z}})$ denote the monic polynomials of degree $n$ with integer coefficients. A monic integer Chebyshev polynomial $M_n \in \mathcal {M}_n({\mathbb {Z}})$ satisfies \begin...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!