# On Integer Chebyshev Polynomials

1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : We are concerned with the problem of minimizing the supremum norm on [0,1] of a nonzero polynomial of degree at most $n$ with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem and improve a lower bound from~[3]
Document type :
Reports
Domain :
Complete list of metadatas

https://hal.inria.fr/inria-00074042
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:22:29 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Thursday, March 24, 2011 - 1:59:32 PM

### Identifiers

• HAL Id : inria-00074042, version 1

### Citation

Laurent Habsieger, Bruno Salvy. On Integer Chebyshev Polynomials. [Research Report] RR-2648, INRIA. 1995. ⟨inria-00074042⟩

Record views