Sign uncertainty principles and low-degree polynomials
From MaRDI portal
Abstract: We prove an asymptotically sharp version of the Bourgain-Clozel-Kahane and Cohn-Gonc{c}alves sign uncertainty principles for polynomials of bounded degree times a Gaussian, as the dimension tends to infinity. In particular, we show that polynomials of bounded degree cannot improve 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.
This page was built for publication: Sign uncertainty principles and low-degree polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506721)
