August 15, 2024
We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.
Similar papers 1
February 29, 2008
We show that if A is a set having small subtractive doubling in an abelian group, that is |A-A|< K|A|, then there is a polynomially large subset B of A-A so that the additive energy of B is large than (1/K)^{1 - \epsilon) where epsilon is a positive, universal exponent. (1/37 seems to suffice.)
May 13, 2014
In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we give criteria for a set to be a 1) set of the form H+L, where H+H is small and L has "random structure", 2) set equals a disjoint union of sets H_j, each H_j has small doubling, 3) set having large subset A' with 2A' is equal to a set with ...
February 12, 2015
Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is asymptotically $o(|B|^6)$. In particular, we extend to sets of small doubling and polynomial growth the classical Multiplication Table theorem of Erd\H{o}s saying that $|[1..n]. [1..n]| = o(n^2)$.
September 10, 2021
We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set $A$ of integers may be written as $A = B \cup C$, where $B$ and $C$ are disjoint sets satisfying \[ |\{ (b_1, \dots, b_{2s}) \in B^{2s} \ | \ b_1 + \dots + b_{s} = b_{s+1} + \dots + b_{2s}\}| \ll_{s} |B|^{2s - (\log \log s)^{1/2 - o(1)}} \] and \[ |\{ (c_1, \dots, c_{2s}) \in C^{2s} \ | \ c_1 \dots c_{s} = c_{s+1} \dots c_{2s} \}| \ll_{s} |C|^{2s - (\log \log s)^{1/2...
December 27, 2012
In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the notion of dual popular difference sets.
June 23, 2023
The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat better properties; for instance, it contracts upon applying a homomorphism. In this paper we develop further the theory of entropic doubling and give various applications, including: (1) A new proof of a result of P\'alv\"olgyi and Zhelezov...
In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool is a new result which provides a nontrivial upper bound on the multiplicative energy of a sum set or difference set.
December 26, 2017
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
February 10, 2016
We improve a previous sum--products estimates in R, namely, we obtain that max{|A+A|,|AA|} \gg |A|^{4/3+c}, where c any number less than 5/9813. New lower bounds for sums of sets with small the product set are found. Also we prove some pure energy sum--products results, improving a result of Balog and Wooley, in particular.
December 2, 2015
These notes basically contain a material of two mini--courses which were read in G\"{o}teborg in April 2015 during the author visit of Chalmers & G\"{o}teborg universities and in Beijing in November 2015 during "Chinese--Russian Workshop on Exponential Sums and Sumsets". The article is a short introduction to a new area of Additive Combinatorics which is connected which so--called the higher sumsets as well as with the higher energies. We hope the notes will be helpful for a ...