The self-dual relaxed lattice equality conjecture

About 25 years old · traced to

A relaxed lattice is a tempered distribution gg such that gg and its Fourier transform g^\widehat{g} have the form

∑i≥0aiδri\sum_{i \ge 0} a_i \delta_{r_i}

where ai≥0a_i \ge 0 for all ii (not all zero) and 0=r0<r1<r2<⋯0=r_0<r_1<r_2<\cdots. It is self-dual when g^=g\widehat{g}=g.

Self-dual relaxed lattice conjecture. In every dimension, the largest possible value of r1r_1 among self-dual relaxed lattices equals the smallest value of rr possible in Theorem 3.2 of Cohn and Elkies.

This conjecture identifies the optimum of the rescaled self-dual relaxed-lattice problem with the optimum in the earlier dual-program bound for sphere packing. The supplied text does not state whether this equality has been proved or disproved.

References

Primary source

Henry Cohn, “New upper bounds on sphere packings II”, arXiv:math/0110010 (2002).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.