The lattice packing problem in dimension 9 by Voronoi's algorithm

In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates the finitely many perfect lattices up to similarity in a fixed dimension. However, due to the high complexity of the algorithm this enumeration had, until now, only been completed up to dimension 8. In this work we compute all 2237251040 perfect lattices in dimension 9 via Voronoi's algorithm. As a corollary, this shows that the laminated lattice $Λ_9$ gives the densest lattice packing in dimension 9. Equivalently, we show that the Hermite constant $γ_9$ in dimension 9 equals $2$. Furthermore, we extend a result by Watson (1971) and show that the set of possible kissing numbers in dimension 9 is precisely $2 \cdot \{ 1, \ldots, 91, 99, 120, \ldots, 129, 136 \}$.