The linear-programming and sign uncertainty constants conjecture

About 6 years old · traced to

Let d⩾1d\geqslant 1 and let ALP(d)\mathbb{A}_{LP}(d) and A−(d)\mathbb{A}_-(d) denote, respectively, the linear-programming and negative sign uncertainty constants defined in the paper.

Linear-programming and sign uncertainty conjecture.

ALP(d)=A−(d).\mathbb{A}_{LP}(d)=\mathbb{A}_-(d).

This would establish a precise link between the sign uncertainty principle and the sphere-packing problem. It is known in dimensions 11, 88, and 2424, while the source presents it as an open conjecture in general.

References

Primary source

Felipe Gonçalves, Diogo Oliveira e Silva and João P. G. Ramos, “New Sign Uncertainty Principles”, arXiv:2003.10771 (2023).

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.