The supremum of autoconvolutions, with applications to additive number theory

From MaRDI portal
Publication:2267696

zbMATH Open1196.42008arXiv0807.5121MaRDI QIDQ2267696FDOQ2267696


Authors: Greg Martin, Kevin O'Bryant Edit this on Wikidata


Publication date: 1 March 2010

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Abstract: We adapt a number-theoretic technique of Yu to prove a purely analytic theorem: if f(x) is in L^1 and L^2, is nonnegative, and is supported on an interval of length I, then the supremum of the convolution f*f is at least 0.631 | f |_1^2 / I. This improves the previous bound of 0.591389 | f |_1^2 / I. Consequently, we improve the known bounds on several related number-theoretic problems. For a subset A of {1,2, ..., n}, let g be the maximum multiplicity of any element of the multiset {a+b: a,b in A}. Our main corollary is the inequality gn>0.631|A|^2, which holds uniformly for all g, n, and A.


Full work available at URL: https://arxiv.org/abs/0807.5121




Recommendations




Cites Work


Cited In (8)





This page was built for publication: The supremum of autoconvolutions, with applications to additive number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267696)