On common energies and sumsets

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$, 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.

Given a set of integers $A$ and an integer $k$, write $A+k\cdot A$ for the set $\{a+kb:a\in A,b\in A\}$. Hanson and Petridis showed that if $|A+A|\le K|A|$ then $|A+2\cdot A|\le K^{2.95}|A|$. At a presentation of this result, Petridis stated that the highest known value for $\frac{\log(|A+2\cdot A|/|A|)}{\log(|A+A|/|A|)}$ (bounded above by 2.95) was $\frac{\log 4}{\log 3}$. We show that, for all $\epsilon>0$, there exist $A$ and $K$ with $|A+A|\le K|A|$ but with $|A+2\cdot A|...

Assume that $A\subseteq \Fp, B\subseteq \Fp^{*}$, $\1/4\leqslant\frac{|B|}{|A|},$ $|A|=p^{\alpha}, |B|=p^{\beta}$. We will prove that for $p\geqslant p_0(\beta)$ one has $$\sum_{b\in B}E_{+}(A, bA)\leqslant 15 p^{-\frac{\min\{\beta, 1-\alpha\}}{308}}|A|^3|B|.$$ Here $E_{+}(A, bA)$ is an additive energy between subset $A$ and it's multiplicative shift $bA$. This improves previously known estimates of this type.

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we improve the length of progression guaranteed in higher sumsets; for example we show that A+A+A contains a progression of length roughly N^{ca} improving on the previous best of N^{ca^{2+\epsilon}}.

The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also establish an upper bound for such sums, which is similar to, but often stronger than Plunnecke's inequality.

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field differ significantly.

We provide further explanation of the significance of a construction in a recent paper of Wolf [Israel J. Math. 179 (2010), 253-278] in the context of the problem of finding large subspaces in sumsets.

Recent advances have linked various statements involving sumsets and cardinalities with corresponding statements involving sums of random variables and entropies. In this vein, this paper shows that the quantity $2{\bf H}\{X, Y\} - {\bf H}\{X+Y\}$ is a natural entropic analogue of the additive energy $E(A,B)$ between two sets. We develop some basic theory surrounding this quantity, and demonstrate its role in the proof of Tao's entropy variant of the Balog--Szemer\'edi--Gower...

We study extremal problems about sets of integers that do not contain sumsets with summands of prescribed size. We analyse both finite sets and infinite sequences. We also study the connections of these problems with extremal problems of graphs and hypergraphs.

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$ fixed, we provide an upper bound on the number of such sets which is tight up to a factor of $2^{o(s)},$ when $G=\mathbb{Z}$ and $K=o(s/(\log n)^3)$. We also provide a generalization of this result to arbitrary abelian groups which is tigh...