November 5, 2021
The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for \[ |2^k f(A) - (2^k-1)f(A)|. \] We also generalise a recent result of Hanson, Roche-Newton and Senger, by proving that for any finite $A\subset \mathbb{R}$ \[ | 2^k f(sA-sA) - (2^k-1) f(sA-sA)| \g...
January 3, 2022
We derive several new bounds for the problem of difference sets with local properties, such as establishing the super-linear threshold of the problem. For our proofs, we develop several new tools, including a variant of higher moment energies and a Ramsey-theoretic approach for the problem.
September 20, 2017
We adapt the idea of higher moment energies, originally used in Additive Combinatorics, so that it would apply to problems in Discrete Geometry. This new approach leads to a variety of new results, such as (i) Improved bounds for the problem of distinct distances with local properties. (ii) Improved bounds for problems involving expanding polynomials in ${\mathbb R}[x,y]$ (Elekes-Ronyai type bounds) when one or two of the sets have structure. Higher moment energies seem...
August 18, 2020
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any finite set of numbers $B.$ The bound is tight up to the constant multiplier. We give a new proof to this result using bounds on crossing numbers of geometric graphs. We construct examples showing the limits of possible improvements. In par...
October 21, 2021
Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg) |A| - O_{d}(|A|^{1- \delta}), \] for some absolute constant $\delta>0$ that only depends on $d$. This provides a sharp main term, consequently answering questions of Ruzsa and Stanchescu up to an $O_{d}(|A|^{1- \delta})$ error term. We also p...
March 19, 2015
We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved effectively for sets A from R with |AA| \le |A|^{4/3}.
November 27, 2019
Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small product with $A$.
April 30, 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)}$. We deduce several new sum-product type implications, e.g. that $A+A$ being small implies unbounded growth for a many enough times iterated product set $A \cdots A$.
June 27, 2024
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...
May 22, 2020
We improve the best known sum-product estimates over the reals. We prove that \[ \max(|A+A|,|AA|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,, \] for a finite $A\subset \mathbb R$, following a streamlining of the arguments of Solymosi, Konyagin and Shkredov. We include several new observations to our techniques. Furthermore, \[ |AA+AA|\geq |A|^{\frac{127}{80} - o(1)}\,. \] Besides, for a convex set $A$ we show that \[ |A+A|\geq |A|^{\frac{30}{19}-o(1)}\,. \] This paper ...