Near optimal bounds in Freiman's theorem

@article{Schoen2011NearOB,
  title={Near optimal bounds in Freiman's theorem},
  author={Tomasz Schoen},
  journal={Duke Mathematical Journal},
  year={2011},
  volume={158},
  pages={1-12}
}
  • T. Schoen
  • Published 15 May 2011
  • Mathematics
  • Duke Mathematical Journal
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 some absolute constant C. We also discuss a number of applications of this result. 

On the Bogolyubov–Ruzsa lemma

Our main result is that if A is a finite subset of an abelian group with |A+A| < K|A|, then 2A-2A contains an O(log^{O(1)} K)-dimensional coset progression M of size at least exp(-O(log^{O(1)} K))|A|.

Additive Volume of Sets Contained in Few Arithmetic Progressions

TLDR
The formula for the largest volume of a finite set of integers with given cardinality and doubling is extended to sets of every dimension and proved for sets composed of three segments, giving structural results for the extremal case.

Small Doubling in Groups

Let A be a subset of a group G = (G; ·). We will survey the theory of sets A with the property that |A · A|≤K|A|, where A · A = {a1a2: a1; a2 ∈ A}. The case G = (ℤ; +) is the famous Freiman-Ruzsa

A statistical approach to covering lemmas

Some new inequalities in additive combinatorics

In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian group. We apply the inequalities to obtain new upper bounds for the

Sums of Linear Transformations in Higher Dimensions

In this paper, we prove the following two results. Let d be a natural number and q, s be co-prime integers such that 10 depending only on q, s and d such that for any finite subset A of ℝd that is

ADDITIVE DIMENSION AND A THEOREM OF SANDERS

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

Roth’s theorem in many variables

We prove that if A ⊆ {1, ..., N} has no nontrivial solution to the equation x1 + x2 + x3 + x4 + x5 = 5y, then $|A| \ll Ne^{ - c(\log N)^{1/7} } $, c > 0. In view of the well-known Behrend

On additive shifts of multiplicative subgroups

It is proved that for an arbitrary subgroup and any distinct nonzero elements we have under the condition that , where , are some sequences of positive numbers such that as . Furthermore, it is shown

An elementary additive doubling inequality

We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a

References

SHOWING 1-10 OF 31 REFERENCES

Freiman's theorem in an arbitrary abelian group

A famous result of Freiman describes the structure of finite sets A ⊆ ℤ with small doubling property. If |A + A| ⩽ K|A|, then A is contained within a multidimensional arithmetic progression of

Finite and infinite arithmetic progressions in sumsets

We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficiently large constant, then the collection of subset sums of A contains an arithmetic progression of

A new proof of Szemerédi's theorem

In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these

Finite field models in additive combinatories

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small

On Additive Doubling and Energy

TLDR
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}}$.

A polynomial bound in Freiman's theorem

.Earlier bounds involved exponential dependence in αin the second estimate. Ourargument combines I. Ruzsa’s method, which we improve in several places, as well asY. Bilu’s proof of Freiman’s

Some consequences of the Polynomial Freiman–Ruzsa Conjecture

Appendix to ‘Roth’s theorem on progressions revisited,’ by

The previous best estimates are due to Chang [Cha02] who showed the above result (up to logarithmic factors) with 2 in place of 7/4. Note that one cannot hope to improve the dimension bound past ⌊K −

On a question of Erdős and Moser

For two finite sets of real numbers A and B, one says that B is sum-free with respect to A if the sum set {b + b | b, b ∈ B, b 6= b} is disjoint from A. Forty years ago, Erdős and Moser posed the