English

An almost-tight $L^2$ autoconvolution inequality

Combinatorics 2022-11-01 v1 Number Theory

Abstract

Let F\mathcal{F} denote the set of functions f ⁣:[1/2,1/2]Rf \colon [-1/2,1/2] \to \mathbb{R} such that f=1\int f = 1. We determine the value of inffFff2\inf_{f \in \mathcal{F}} \| f \ast 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]B_h[g] sets for (g,h){(2,2),(3,2),(4,2),(1,3),(1,4)}(g,h) \in \{ (2,2),(3,2),(4,2),(1,3),(1,4)\}.

Keywords

Cite

@article{arxiv.2210.16437,
  title  = {An almost-tight $L^2$ autoconvolution inequality},
  author = {Ethan Patrick White},
  journal= {arXiv preprint arXiv:2210.16437},
  year   = {2022}
}

Comments

18 pages, 1 figure, 1 table

R2 v1 2026-06-28T04:45:09.468Z