Wiener's problem for positive definite functions (Q1668436): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
 
Property / arXiv ID
 
Property / arXiv ID: 1604.01302 / rank
 
Normal rank

Latest revision as of 21:34, 18 April 2024

scientific article
Language Label Description Also known as
English
Wiener's problem for positive definite functions
scientific article

    Statements

    Wiener's problem for positive definite functions (English)
    0 references
    28 August 2018
    0 references
    Let \(n \in \mathbb{N}\) and \(\mathbb{T}^n=\mathbb{R}^n / \mathbb{Z}^n.\) The authors study the sharp constant \(W_n(D)\) in Wiener's inequality for positive definite functions \[ \int_{\mathbb{T}^n} |f|^2dx \leq W_n(D) |D|^{-1} \int_{D} |f|^2 dx, \] where \(D \subset \mathbb{T}^n\) is an origin-symmetric convex body and \(|D|\) is its volume. In 1981, \textit{E. Hlawka} [Comment. Math. Helv. 56, 66--82 (1981; Zbl 0459.10021)] showed that \(W_n(D) \leq 2^n.\) In the paper Hlawka's estimates for \(D\) being the ball \(\delta B^n=\{x \in \mathbb{R}^n: |x| \leq \delta\}\) and the cube \(\delta I^n=[-\delta, \delta]^n\) are sharpened. More precisely the following estimates are obtained: if \(\delta \in (0, 1/2),\) then \(W_n(\delta B^n) \leq 2^{(0.401\ldots +o(1))n}\), and \(W_n(\delta I^n) \leq 2^n(1-\theta(\delta))^n,\) where \(0 \leq \theta (\delta)<1\) is continuous on \((0, 1/2),\) and, \(\theta(\delta)=O(\delta^2)\) as \( \delta \to 0.\) Moreover, the authors prove that \(W_n(D)=2^n\) if \(D=\frac{1}{q} I^n\) with \(q=3, 4, \ldots.\) The proofs of these estimates are based on the interrelation between Wiener's problem and Turán's and Delsarte's problems.
    0 references
    0 references
    0 references
    0 references
    0 references
    positive definite function
    0 references
    Wiener's problem
    0 references
    Turán's problem
    0 references
    Delsarte's problem
    0 references
    Hlawka's inequality
    0 references
    linear programming bound problem
    0 references
    0 references
    0 references
    0 references
    0 references