An almost-tight L2 autoconvolution inequality
Abstract
Let F denote the set of functions f [-1/2,1/2] R such that ∫ f = 1. We determine the value of ∈ff ∈ F \| f f \|2 up to a 0.0014\% error, thereby making progress on a problem asked by Ben Green. Furthermore, we prove that a unique minimizer exists. As a corollary, we obtain improvements on the maximum size of Bh[g] sets for (g,h) ∈ \ (2,2),(3,2),(4,2),(1,3),(1,4)\.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.