# On Sumsets of Convex Sets

@article{Schoen2011OnSO,
title={On Sumsets of Convex Sets},
author={T. Schoen and I. Shkredov},
journal={Combinatorics, Probability and Computing},
year={2011},
volume={20},
pages={793 - 798}
}
• Published 2011
• Mathematics, Computer Science
• Combinatorics, Probability and Computing
A set of reals A = {a1,. . .,an} is called convex if ai+1 − ai > ai − ai−1 for all i. We prove, among other results, that for some c > 0 every convex A satisfies |A−A| ≥ c|A|8/5log−2/5|A|.

#### Topics from this paper

Sharpening an Estimate of the Size of the Sumset of a Convex Set
A finite set A = { a 1 < … < a n }⊂ ℝ is said to be convex if the sequence ( a i − a i −1 ) i =2 n is strictly increasing. Using an estimate of the additive energy of convex sets, one can estimateExpand
On a theorem of Schoen and Shkredov on sumsets of convex sets
A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$,Expand
Difference sets are not multiplicatively closed
We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similarExpand
Improved bounds on the set A(A+1)
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 2013
In the finite field case, it is shown that A(A+1) is of cardinality at least |A|^5^7^/^5-^6^-^o^(^1^), so long as |A | is a subset of a field F. Expand
Convex sequences may have thin additive bases
• Mathematics
• 2017
For a fixed $c > 0$ we construct an arbitrarily large set $B$ of size $n$ such that its sum set $B+B$ contains a convex sequence of size $cn^2$, answering a question of Hegarty.
On the number of unit-area triangles spanned by convex grids in the plane
• Mathematics, Computer Science
• Comput. Geom.
• 2017
It is shown that, for any pair of convex sets A, B R, each of size n 1 / 2 , the convex grid A B spans at most O ( n 37 / 17 log 2 / 17 n ) unit-area triangles. Expand
On sum sets of convex functions
• Mathematics
• 2021
In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all A,B ⊆ R finite sets, and for all f, g convex or concave functions, we have |A+B||f(A) +Expand
C O ] 4 O ct 2 01 9 On distinct consecutive differences
• 2019
We show that if A= {a1 < a2 < .. . < ak} is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite B ⊂ R, |A+B| ≫ |A||B|. The bound is tight upExpand
Higher convexity and iterated sum sets
• Mathematics
• 2020
Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. WeExpand
On a question of A. Balog
We give a partial answer to a conjecture of A. Balog, concerning the size of AA+A, where A is a finite subset of real numbers. Also, we prove several new results on the cardinality of A:A+A, AA+AAExpand