The multivariate integer Chebyshev problem (Q836090): Difference between revisions

The multivariate integer Chebyshev problem is to find integer polynomials that minimize the supremum norm over some compact subset of \({\mathbb C}^d\). The authors study this problem mainly for product sets such as cubes and polydisks. They also establish a multivariate analog of the classical Hilbert-Fekete upper bound for the Chebyshev constant.