Polarization of lattices: Stable cold spots and spherical designs
Abstract
We consider the problem of finding the minimum of inhomogeneous Gaussian lattice sums: Given a lattice L ⊂eq Rn and a positive constant α, the goal is to find the minimizers of Σx ∈ L e-α \|x - z\|2 over all z ∈ Rn. By a result of B\'etermin and Petrache from 2017 it is known that for steep potential energy functions - when α tends to infinity - the minimizers in the limit are found at deep holes of the lattice. In this paper, we consider minimizers which already stabilize for all α ≥ α0 for some finite α0; we call these minimizers stable cold spots. Generic lattices do not have stable cold spots. For several important lattices, like the root lattices, the Coxeter-Todd lattice, and the Barnes-Wall lattice, we show how to apply the linear programming bound for spherical designs to prove that the deep holes are stable cold spots. We also show, somewhat unexpectedly, that the Leech lattice does not have stable cold spots.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.