On an almost all version of the Balog-Szemeredi-Gowers theorem

Abstract

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'edi-Gowers theorem: For any K≥ 1 and > 0, there exists δ = δ(K,)>0 such that the following statement holds: if |A+A| ≤ K|A| for some ≥ (1-δ)|A|2, then there is a subset A' ⊂ A with |A'| ≥ (1-)|A| such that |A'+A'| ≤ |A+A| + |A|. We also discuss issues around quantitative bounds in this statement, in particular showing that when A ⊂ Z the dependence of δ on ε cannot be polynomial for any fixed K>2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…