On sum sets of convex functions
Combinatorics
2021-02-11 v1 Number Theory
Abstract
In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all finite sets, and for all convex or concave functions, we have This result can be used to obtain bounds on a number of two-variable expanders of interest, as well as to the asymmetric sum-product problem. We also adjust our technique to also prove the three-variable expansion result Our methods follow a series of recent developments in the sum-product literature, presenting a unified picture. Of particular interest is an adaptation of a regularisation technique of Xue, that enables us to find positive proportion subsets with certain desirable properties.
Cite
@article{arxiv.2102.05446,
title = {On sum sets of convex functions},
author = {Sophie Stevens and Audie Warren},
journal= {arXiv preprint arXiv:2102.05446},
year = {2021}
}
Comments
16 pages plus appendix