On a theorem of Schoen and Shkredov on sumsets of convex sets
Liangpan Li

TL;DR
This paper establishes a new lower bound on the size of sumsets of convex sets of real numbers, improving understanding of their additive structure and implications for related sum-product problems.
Contribution
It proves a novel lower bound on sumsets of convex sets and explores related sumset properties and applications to sum-product problems.
Findings
Lower bound |A+A| ≫ |A|^{14/9} / (log|A|)^{2/9} for convex sets
Analysis of sumsets of different summands
Application to sum-product-type problems
Abstract
A set of reals labeled in increasing order is called convex if there exists a continuous strictly convex function such that for every . Given a convex set , we prove \[|A+A|\gg\frac{|A|^{14/9}}{(\log|A|)^{2/9}}.\] Sumsets of different summands and an application to a sum-product-type problem are also studied either as remarks or as theorems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Approximation and Integration · Advanced Banach Space Theory
