On the dimension of additive sets

We develop the theory of the additive dimension ${\rm dim} (A)$, i.e. the size of a maximal dissociated subset of a set $A$. It was shown that the additive dimension is closely connected with the growth of higher sumsets $nA$ of our set $A$. We apply this approach to demonstrate that for any small multiplicative subgroup $\Gamma$ the sequence $|n\Gamma|$ grows very fast. Also, we obtain a series of applications to the sum--product phenomenon and to the Balog--Wooley decomposi...

We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections between the Erdos and Falconer distance problems in geometric combinatorics and geometric measure theory, respectively.

This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem using elementary arguments about covering numbers. We also give a short introduction to additive combinatorics, focusing on inverse theorems, which play a pivotal role in the proof. Our elementary approach avoids many of the technicalities in...

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of as a major quantitative improvement on Fre\u{i}man's dimension lemma, or as a "weak" Fre\u{i}man--Ruzsa theorem with almost polynomial bounds. The methods used, centered around an "additive energy increment strategy", differ from the usual...

We are discussing the theorem about the volume of a set $A$ of $Z^n$ having a small doubling property $|2A| < Ck, k=|A|$ and oher problems of Structure Theory of Set Addition (Additive Combinatorics).

We prove some new bounds for the size of the maximal dissociated subset of structured (having small sumset, large energy and so on) subsets A of an abelian group.

The counting and (upper) mass dimensions are notions of dimension for subsets of $\mathbb{Z}^d$. We develop their basic properties and give a characterization of the counting dimension via coverings. In addition, we prove Marstrand-type results for both dimensions. For example, if $A \subseteq \mathbb{R}^d$ has counting dimension $D(A)$, then for almost every orthogonal projection with range of dimension $k$, the counting dimension of the image of $A$ is at least $\min \big(k...

Combining Freiman's theorem with Balog-Szemeredi-Gowers theorem one can show that if an additive set has large additive energy, then a large piece of the set is contained in a generalized arithmetic progression of small rank and size. In this paper, we prove the above statement with the optimal bound for the rank of the progression. The proof strategy involves studying upper bounds for additive energy of subsets of R^d and Z^d.

This paper is an exposition, with some new applications, of our results on the growth of entropy of convolutions. We explain the main result on $\mathbb{R}$, and derive, via a linearization argument, an analogous result for the action of the affine group on $\mathbb{R}$. We also develop versions of the results for entropy dimension and Hausdorff dimension. The method is applied to two problems on the border of fractal geometry and additive combinatorics. First, we consider at...

We propose a counting dimension for subsets of Z and prove that, under certain conditions on two such subsets E and F, for Lebesgue almost every real \lambda\ the counting dimension of E+[\lambda F] is at least the minimum between 1 and the sum of the counting dimensions of E and F. Furthermore, if the sum of the counting dimensions of E and F is larger than 1, then E+[\lambda F] has positive upper Banach density for Lebesgue almost every \lambda. The result has direct conseq...