Back Séminaire de Théorie Algorithmique des Nombres
Salle 385
November 28, 2017 at 10:00 AM
We define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tesselation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the irreducible root lattices and for this we apply a generalization of the Hoffman bound.