# Solving packing problems by linear programming

Monday, April 3, 2017 -

5:15pm to 6:15pm

Part 3: Fourier interpolation.The sphere packing problem asks which biggest portion of the euclidean d-dimensional space can be covered by non-overlapping 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.

Speaker:

Maryna Viazovska

Humboldt University

Event Location:

Fine Hall 314