Duke Mathematical Journal · 2002 · 214 citations · 19 references
Natural SciencesMathematicsCombinatoricsNumber TheorySet TheoryArithmetic GeometryCombinatorial Set TheoryFreiman's TheoremPolynomial Freiman-ruzsa Conjecture
In this paper the following improvement on Freiman's theorem on set addition is obtained (see Theorems 1 and 2 in Section 1). Let A⊂ℤ be a finite set such that | A+A |<α| A | . Then A is contained in a proper d-dimensional progression P, where d≤[ α−1 ] and log( | P |/| A | )<C α 2 ( logα ) 3 . Earlier bounds involved exponential dependence in α in the second estimate. Our argument combines I. Ruzsa's method, which we improve in several places, as well as Y. Bilu's proof of Freiman's theorem.
19
A new proof of Szemerédi's theorem
W. T. Gowers · Geometric and Functional Analysis · 2001 · 724 citations
K. F. Roth · Journal of the London Mathematical Society · 1953 · 616 citations
Extremal problems in discrete geometry
Endre Szemerédi, W. T. Trotter · COMBINATORICA · 1983 · 556 citations