Sign uncertainty principles and low-degree polynomials
arXiv:2210.01684 · doi:10.1090/bproc/219
Abstract
We prove an asymptotically sharp version of the Bourgain-Clozel-Kahane and Cohn-Gonçalves sign uncertainty principles for polynomials of sublinear degree times a Gaussian, as the dimension tends to infinity. In particular, we show that polynomials whose degree is sublinear in the dimension cannot improve asymptotically on those of degree at most three. This question arises naturally in the study of both linear programming bounds for sphere packing and the spinless modular bootstrap bound for free bosons.
5 pages
References in corpus (8)
- The sphere packing problem in dimension 24
- The sphere packing problem in dimension 8
- Averaging Over Narain Moduli Space
- Free partition functions and an averaged holographic duality
- Constraints on 2d CFT partition functions
- Sphere Packing and Quantum Gravity
- Fast Conformal Bootstrap and Constraints on 3d Gravity
- High-dimensional sphere packing and the modular bootstrap