This post continues my series on favourite theorems of the twenty-first century. For an overview of the categories and my earlier selections, see this introductory post.
My choice for 2006 in Geometry and Topology is a theorem of Christine Bachoc and Frank Vallentin giving new upper bounds for kissing numbers. Their paper was first posted online on August 16, 2006, and appeared in the Journal of the American Mathematical Society in 2008 (Bachoc and Vallentin 2008).
How many balls of the same size can touch one central ball? We require all the balls to have disjoint interiors, but they may touch one another. The largest possible number of balls surrounding the central one in is called the kissing number, denoted by . In the plane, six equal coins fit around a seventh, and there is no room for an eighth. Thus . In three dimensions, the answer is . In four dimensions, Oleg Musin (Musin 2008) proved that . His proof first appeared as a preprint in 2003, so the four-dimensional problem had already been solved by the time Bachoc and Vallentin posted their paper. Dimension five was therefore the first dimension in which the kissing number was still unknown. The exact value was also already known (Odlyzko and Sloane 1979), which explains why dimension eight is absent from the table below.
To see how this becomes a problem about points on a sphere, take the central ball to have radius one and centre zero. The centres of the surrounding balls lie at distance two from zero. Dividing these centres by two gives unit vectors, any two of which must be at distance at least one. For unit vectors and , so the condition is equivalent to . In other words, is the largest number of unit vectors in with angles of at least degrees between every pair.
For many years, the main tool for bounding this number was Delsarte’s linear programming method. It places restrictions on how often different inner products can occur among pairs of vectors. Using this method, Odlyzko and Sloane (Odlyzko and Sloane 1979) obtained, among other results, the bounds and .
Bachoc and Vallentin’s idea was to look at triples of vectors. This gave the following improvements.
Theorem. In each dimension listed below, the kissing number is at most the number in the last row.
What can triples tell us that pairs cannot? Take three unit vectors and write for their three pairwise inner products. The matrix of their inner products is It is positive semidefinite: its quadratic form is the squared length of a linear combination of the three vectors. In particular, its determinant is nonnegative, which gives This is a restriction on how the three inner products can occur together.
The proof goes beyond checking individual triples. It uses polynomials adapted to the sphere to derive positive semidefinite matrix constraints involving sums over all triples in a configuration. These constraints lead to a semidefinite program. Since every arrangement of touching balls must satisfy the constraints, the program gives an upper bound valid for all arrangements. The authors used numerical computations to find certificates for the bounds and then checked them using rational arithmetic.
In my earlier post on upper bounds for sphere packings, we saw how linear programming could bound the density of a packing. What I like about Bachoc and Vallentin’s theorem is that it shows how to bring more geometry into an optimization problem: keeping track of which angles occur together lets us rule out configurations that the pairwise bounds could not exclude. The method could also be refined. In 2010, Mittelmann and Vallentin (Mittelmann and Vallentin 2010) lowered the upper bounds in dimensions five and seven to and , respectively. Machado and de Oliveira Filho (Machado and Oliveira Filho 2018) used symmetry to make larger semidefinite programs tractable, obtaining and . In 2024, de Laat, Leijenhorst, and de Muinck Keizer (Laat et al. 2024) used a method that also takes four-point configurations into account to prove . Progress came from the other direction as well: Ganzhinov (Ganzhinov 2025) constructed an arrangement of touching balls in dimension ten, improving the previous lower bound of .
There has been another round of improvements in November 2026. Tomar (Tomar 2026) gave exact rational certificates for , , and . A separate preprint by Nyam-Osor (Nyam-Osor 2026) reports , one below the journal-published bound of .
Here are the best bounds I found as of November 20, 2026, including those reported in the new preprints. The lower bounds come from explicit constructions; see also Henry Cohn’s table of kissing number bounds. None of these five kissing numbers is known exactly.
Bachoc and Vallentin’s theorem is still my choice for 2006 because it gave later researchers a way to keep improving the bounds. Once the geometry of triples was expressed in a semidefinite program, one could use symmetry to solve larger instances or bring four points into the picture. The idea also reached beyond kissing numbers: Cohn, de Laat, and Salmon (Cohn et al. 2022) used three-point constraints to improve upper bounds on sphere-packing density. That reach is what makes the theorem memorable to me: an idea introduced to count the balls touching one ball also helps bound how densely balls can fill an entire space.