The multivariate integer Chebyshev problem (Q836090)
From MaRDI portal
| Error creating thumbnail: | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The multivariate integer Chebyshev problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multivariate integer Chebyshev problem |
scientific article |
Statements
The multivariate integer Chebyshev problem (English)
0 references
31 August 2009
0 references
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.
0 references
multivariate integer polynomials
0 references
Chebyshev problem
0 references
0 references
0.8285796642303467
0 references
0.8269059062004089
0 references
0.8043360710144043
0 references
0.8031942248344421
0 references
