The multivariate integer Chebyshev problem

From MaRDI portal
Publication:836090

DOI10.1007/S00365-008-9029-8zbMATH Open1246.11075arXiv1307.5456OpenAlexW2079502839MaRDI QIDQ836090FDOQ836090

Igor E. Pritsker, Peter Borwein

Publication date: 31 August 2009

Published in: Constructive Approximation (Search for Journal in Brave)

Abstract: The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in Cd. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimension of space. In the case of single variable polynomials in the complex plane, our estimate coincides with the Hilbert-Fekete result.


Full work available at URL: https://arxiv.org/abs/1307.5456




Recommendations




Cites Work


Cited In (8)





This page was built for publication: The multivariate integer Chebyshev problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836090)