The kissing number of a lattice, $L$, is the number of vectors of minimal length. The vectors in the list of minimal length vectors are normalized, so the kissing number will always be twice as large as the number of vectors in this list.
The lattice kissing number problem in dimension $n$ is to find the lattices of dimension $n$ which maximize the kissing number. In general, these may not be solutions of the general kissing number problem, which asks for the maximum number of spheres with non-overlapping interiors in dimension $n$ which are all tangent to a single sphere.
- Review status: reviewed
- Last edited by Kiran S. Kedlaya on 2018-06-26 15:33:17
- 2018-06-26 15:33:17 by Kiran S. Kedlaya (Reviewed)