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 we have a lower bound for the counting functions which very closely matches interpolation formulas discovered by Radchenko and Viazovska and by Bondarenko, Radchenko and Seip.
Paper Prompts
Sign up for free to create and run prompts on this paper.