The multivariate integer Chebyshev problem
From MaRDI portal
Abstract: The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in 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.
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.
Recommendations
Cites work
- An introduction to the geometry of numbers.
- scientific article; zbMATH DE number 3116724 (Why is no real title available?)
- scientific article; zbMATH DE number 3871473 (Why is no real title available?)
- scientific article; zbMATH DE number 52146 (Why is no real title available?)
- scientific article; zbMATH DE number 3503564 (Why is no real title available?)
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- scientific article; zbMATH DE number 739279 (Why is no real title available?)
- scientific article; zbMATH DE number 826245 (Why is no real title available?)
- scientific article; zbMATH DE number 3367342 (Why is no real title available?)
- scientific article; zbMATH DE number 3063561 (Why is no real title available?)
- On integer Chebyshev polynomials
- On multivariate minimal polynomials
- On the multivariate transfinite diameter
- Polynomial interpolation of holomorphic functions in \(\mathbb{C}\) and \(\mathbb{C}^ n\)
- Small polynomials with integer coefficients
- The Gelfond–Schnirelman Method in Prime Number Theory
- The integer Chebyshev problem
- The integer transfinite diameter of intervals and totally real algebraic integers
- TRANSFINITE DIAMETER, ČEBYŠEV CONSTANTS, AND CAPACITY FOR COMPACTA IN $ \mathbf{C}^n$
Cited in
(14)- Estimation of norms of multivariate polynomials with integral coefficients
- The replica location problem and Chebyshev polynomials of the second kind
- A note on integer polynomials with small integrals
- A note on integer polynomials with small integrals. II
- scientific article; zbMATH DE number 1303645 (Why is no real title available?)
- The number of certain integral polynomials and nonrecursive sets of integers, Part 1
- Generalized Gorshkov-Wirsing polynomials and the integer Chebyshev problem
- Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem
- On the smallest integer vector at which a multivariable polynomial does not vanish
- A determinantal approach to irrationality
- Uniqueness of solutions in multivariate Chebyshev approximation problems
- Remembering Peter Benjamin Borwein (May 10, 1953 -- August 23, 2020)
- Optimization-aided construction of multivariate Chebyshev polynomials
- Mixed motives and linear forms in the Catalan constant
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)