Solving packing problems by linear programming
Solving packing problems by linear programming

Maryna Viazovska , Humboldt University
Fine Hall 314
Part 2: CohnElkies linear programming bounds and modular forms.The sphere packing problem asks which biggest portion of the euclidean ddimensional space can be covered by nonoverlapping unit balls. In most dimensions d this question is believed be an extremely difficult combinatorial geometric problem. However, in dimensions 8 and 24 the sphere the sphere packing problem has a surprisingly simple solution based on linear programming bounds.The goal of this series of talks is to explain the ideas behind this solution.