Wednesday, 20 October 2021, 14:00 at Virtual (Zoom details under abstract) – The sphere packing problems asks for the densest packing of Euclidean space by congruent balls that do not intersect in their interiors. The Cohn-Elkies linear programming bound can be used to obtain upper bounds on the optimal density and has been used by Viazovska and others to show the E_8 …