Modular forms and sphere packing

In this talk we will give an application of modular forms to the sphere
packing problem. First, we will explain the Cohn-Elkies linear
programming bound for the best packing constant in Euclidean space.
Next, we will show that the linear programming problems corresponding to
dimensions 8 and 24 can be solved explicitly. As a byproduct of our
method, we will prove a new type of interpolation formula for the
Schwartz functions. Finally, using this  approach we  will present  the
solution of the sphere packing problem in dimensions 8 and 24.