math.CA — Classical Analysis and ODEs
Certified lower bounds for the first and the signed third autocorrelation constants
Let be the largest constant such that for every nonnegative function on the real line. We prove , improving the bound of Kim and Pilanci, by a spatial branch-and-bound over the masses of on equal bins. Consequently, for every large , every -Sidon set in has fewer than elements once is large enough in terms of . For real-valued supported in , let and be the analogous constants for the essential suprema of and of ; no lower bound better than the trivial bound was recorded for them. We prove with the argument principle. Both proofs are computer-assisted, and both theorems are also proved in Lean 4.
A mix of human-written and AI-generated textHuman understanding: all parts