English

Fourier interpolation and time-frequency localization

Classical Analysis and ODEs 2020-05-27 v1

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)4R1R2Clog2+ε(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.

Keywords

Cite

@article{arxiv.2005.12836,
  title  = {Fourier interpolation and time-frequency localization},
  author = {Aleksei Kulikov},
  journal= {arXiv preprint arXiv:2005.12836},
  year   = {2020}
}

Comments

9 pages

R2 v1 2026-06-23T15:49:36.583Z