Universally optimal periodic configurations in the plane, Discrete Analysis 2025:22, 63 pp.
Let ωn be a configuration of n points in Rd. We define the energy of ωn to be
EF(ωn)=∑j≠iF(xi−xj),
where F:Rd→R is a potential function. We are interested in the case where F is periodic with respect to some d-dimensional lattice Λ. For the purpose of this paper, we specialize to the case when
Fa(x)=∑v∈Λe−a|x+v|2, a>0,
is a Λ-periodic sum of Gaussians.
We say that a configuration ωn is optimal with respect to Fa as above if it minimizes the emergy EFa over all possible n-point configurations in Rd. We further say that ωn is Λ-universally optimal if it is optimal for all a>0.
Passing from a property of point configurations to a property of the lattice itself, we say that Λ is universally optimal if for any sublattice Φ of Λ, the configuration ω(Φ,Λ):=Λ/Φ (for any choice of representatives) is Λ-universally optimal.
Currently, only three examples of universally optimal lattices are known: the lattice Z in R (due to Cohn and Kumar), and the E8 and Leech lattices in, respectively, R8 and R24 (due to Cohn, Kumar, Miller, Radchenko, and Viazovska). Cohn and Kumar conjectured that the hexagonal lattice in 2 dimensions should also be universally optimal. The hexagonal lattice enjoys many properties that make it a natural candidate: for example, it has long been known to be the optimal configuration for unit circle packing in the plane. However, the problem remains open.
The present paper proves a partial result in the direction of the conjecture, demonstrating that certain natural configurations are universally optimal with respect to the hexagonal lattice. This would follow immediately if the above conjecture were to be confirmed; conversely, proving universal optimality for a larger family of configurations of the same type would prove the conjecture.
The proof is based on linear programming: the main idea is that the energy of a point configuration may be bounded from below in terms of the Fourier coefficients of an appropriately chosen auxiliary function (sometimes called a witness function). The main challenge is to construct the optimal auxiliary functions, and that is what this paper accomplishes.