Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fourier interpolation and time-frequency localization

Published 26 May 2020 in math.CA | (2005.12836v1)

Abstract: We prove that under very mild conditions for any interpolation formula f(x)=∑λ∈Λf(λ)aλ(x)+∑μ∈Mf^(μ)bμ(x)f(x) = \sum_{\lambda\in \Lambda} f(\lambda)a_\lambda(x) + \sum_{\mu\in M} \hat{f}(\mu)b_{\mu}(x) we have a lower bound for the counting functions nΛ(R1)+nM(R2)≥4R1R2−Clog⁡2+ε(4R1R2)n_\Lambda(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.

Authors (1)
Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.