IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

The Integer Chebyshev Problem

  • Oct. 26, 2001
  • 1:30 p.m.
  • LeConte 312


The problem is to minimize the supremum norm on an interval of a non-vanishing polynomial of degree n with integer coefficients. This is a classical (and still open) problem of Hilbert and Fekete. This and the related, though quite different, problem where the minimizing polynomials are required to be monic is the subject of this talk.

© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster