A Szemerédi-type regularity lemma in abelian groups, with applications

Abstract

Szemerédi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemerédi's regularity lemma in the context of abelian groups and use it to derive some results in additive number theory. One is a structure theorem for sets which are almost sum-free. If A ⊆ {1,..., N\} has δN 2 triples (a1, a2, a3) for which a1+ a2 = a3 then A = B ∪ C, where B is sum-free and |C| = δ′N, and δ′ → 0 as δ → 0. Another answers a question of Bergelson, Host and Kra. If α ε > 0, if N > N0(α, ε) and if A ⊆ {1,..., N} has size αN, then there is some d≠0 such that A contains at least (α3}-ε)N three-term arithmetic progressions with common difference d. © Birkhäuser Verlag, Basel 2005.