On Sumsets of Convex Sets

  title={On Sumsets of Convex Sets},
  author={T. Schoen and I. Shkredov},
  journal={Combinatorics, Probability and Computing},
  pages={793 - 798}
  • T. Schoen, I. Shkredov
  • 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)
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
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
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
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
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
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


On the number of solutions of a diophantine equation with symmetric entries
Abstract For a class of strictly increasing real valued functions f ( n ) we obtain an upper bound for the number of solutions of the equation ∑ i = 1 d f ( x i ) = ∑ i = 1 d f ( y i ) , 1 ⩽ x 1 , …Expand
Near optimal bounds in Freiman's theorem
We prove that if for a finite set A of integers we have |A+A| ≤ K|A|, then A is contained in a generalized arithmetic progression of dimension at most K −1/2 and size at most exp(K −1/2 )|A| for someExpand
On cardinality of sumsets
Abstract In this article we study some special problems of the additive number theory connected with an estimate of cardinality of a sum of two sets, which can be convex as well as non-convexExpand
On consecutive sums in sequences
Let A c N. We define B as the following set of integers, called the set of the consecutive sums in the sequence A: B = { 2 a,[A = {al , as, ... , a,,}, l ~_ u <= v <= n}. u~i~o We will call itExpand
  • T. Sanders
  • Mathematics
  • Journal of the Australian Mathematical Society
  • 2010
Abstract We show that if G is a group and A⊂G is a finite set with ∣A2∣≤K∣A∣, then there is a symmetric neighbourhood of the identity S such that Sk⊂A2A−2 and ∣S∣≥exp (−KO(k))∣A∣.
On additive shifts of multiplicative subgroups
Generalizing a result of S.V. Konyagin and D.R. Heath–Brown, we prove, in particular, that for any multiplicative subgroup R ⊆ Z/pZ and any nonzero elements μ1, . . . , μk the following holds |R(R +Expand
Extremal problems in discrete geometry
Several theorems involving configurations of points and lines in the Euclidean plane are established, including one that shows that there is an absolute constantc3 so that whenevern points are placed in the plane not all on the same line, then there is one point on more thanc3n of the lines determined by then points. Expand
On Lower Bounds for the L1-Norm of Exponential Sums
In the paper a method for finding lower bounds of the L1-norm of some exponential sums is described.
On Additive Doubling and Energy
It is shown that there is a universal $\epsilon>0$ so that any subset of an abelian group with subtractive doubling $K$ must be polynomially related to a set with additive energy at least $\frac{1}{K^{1-\ep silon}}$. Expand
On Roth's theorem on progressions
We show that if Af 1;:::;Ng contains no nontrivial three-term arithmetic progressions thenjAj = O(N=log 1 o(1) N).