Hermann Weyl Lectures

Can we reconstruct a function by knowing only a subset of its values and a subset of the values of the function's Fourier transform?
How many values do we need to know for such a reconstruction? Can we interpolate a given subset of values? What are the possible applications of such interpolation? In this series of lectures, we will try to answer these questions.
In the first lecture, we will speak about the Cohn-Elkies linear programming bound for the sphere packing and how this bound's analysis led to the discovery of a Fourier interpolation formula. The second lecture will discuss explicit constructions of Fourier uniqueness sets and Fourier interpolation formulas. The third lecture will focus on analytic approaches to Fourier uniqueness and interpolation.