Florian Block

Packing Problems

This is an introduction to packing problems and how they relate to algebraic combinatorics. We'll see some answers and open questions in various dimension. For example, in dimension 8 the E_8 lattice is the densest, in dimension 24 the densest packing seems to be (conjecturally) the leech lattice whereas in dimension 23 and many others there is not even a conjecture.