Fourier interpolation and time-frequency localization

preprint2020arXivOpen access

Abstract

We prove that under very mild conditions for any interpolation formula f(x)=∑λ∈Λf(λ)aλ(x)+∑μ∈Mf^(μ)bμ(x)f(x) = \sum_{λ\in Λ} f(λ)a_λ(x) + \sum_{μ\in M} \hat{f}(μ)b_μ(x) we have a lower bound for the counting functions nΛ(R1)+nM(R2)≥4R1R2−Clog⁡2+ε(4R1R2)n_Λ(R_1) + n_{M}(R_2) \ge 4R_1R_2 - C\log^{2+\varepsilon}(4R_1R_2) which very closely matches interpolation formulas discovered by Radchenko and Viazovska and by Bondarenko, Radchenko and Seip.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.