Abstract: Viazovska's solution of the sphere packing problem in dimension 8 and the solution of the sphere packing problem in dimension 24 by Cohn, Kumar, Miller, Radchenko and Viazovska rely on linear programming bounds on sphere packing density, developed by Cohn and Elkies.
Cohn and Zhao conjectured that similar linear programming bounds hold for sphere packings in hyperbolic space.
In this talk we will use methods from spherical harmonic analysis and stochastic geometry to prove a variant of Cohn and Zhao's conjecture not only for hyperbolic space, but also for a number of other homogeneous spaces.
If you are interested in participating online please contact Tobias Weich or Benjamin Delarue in order to receive the login details.