Spring 2020

Lattice Packings: An Upper Bound on the Number of Perfect Lattices

Friday, Feb. 21, 2020 11:00 am11:30 am PST

Add to Calendar


Wessel van Woerden, CWI


Calvin Lab Auditorium

We consider an algorithmic approach by Voronoi to solve the lattice packing problem in any fixed dimension. After a visual introduction that makes clear why we should be interested in enumerating so-called perfect lattices, we continue with proving an upper bound on the number of them. This proof will mostly use geometric properties of perfect lattices and we conclude by a volumetric argument.

PDF icon presentation.pdf1.51 MB