Conjecture on optimal linear programming functions for Gaussian energy
Conjecture on optimal linear programming functions for Gaussian energy
Fix a dimension , density , and . For the potential , consider the optimal linear programming bound from the stated linear programming proposition, where is radial and belongs to the Schwartz space. Gaussian linear-programming conjecture. The optimal bound is achieved by some radial Schwartz function such that the radii satisfying are exactly the radii satisfying ; these radii form a discrete infinite set and do not depend on . The conjecture concerns the sharpness and structure of linear programming bounds for Gaussian energy in dimensions at least three; the source presents it as a variant of conjectures of Cohn and Elkies and Cohn and Kumar, with the relevant general interpolation consequences still unresolved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Henry Cohn, Abhinav Kumar, Stephen D. Miller, Danylo Radchenko and Maryna Viazovska, “Universal optimality of the E_8 and Leech lattices and interpolation formulas”, arXiv:1902.05438 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.