ON SUPREMA OF AUTOCONVOLUTIONS WITH AN APPLICATION TO SIDON SETS

被引:5
作者
Cloninger, Alexander [1 ]
Steinerberger, Stefan [2 ]
机构
[1] Yale Univ, Dept Math, Program Appl Math, New Haven, CT 06510 USA
[2] Yale Univ, Dept Math, New Haven, CT 06511 USA
基金
美国国家科学基金会;
关键词
Sidon sets; autoconvolutions; SEQUENCES; SQUARES; BOUNDS; NUMBER;
D O I
10.1090/proc/13690
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let f be a nonnegative function supported on (- 1/4, 1/4). We show that sup (x is an element of R)integral(R) f(t) f(x - t) dt >= 1.28 (integral(1/ 4)(-1/ 4) f(x) dx)(2), where 1.28 improves on a series of earlier results. The inequality arises naturally in additive combinatorics in the study of Sidon sets. We derive a relaxation of the problem that reduces to a finite number of cases and yields slightly stronger results. Our approach should be able to prove lower bounds that are arbitrary close to the sharp result. Currently, the bottleneck in our approach is runtime: new ideas might be able to significantly speed up the computation.
引用
收藏
页码:3191 / 3200
页数:10
相关论文
共 12 条