A Szemerédi-type regularity lemma in abelian groups, with applications
@article{Green2003ASR, title={A Szemer{\'e}di-type regularity lemma in abelian groups, with applications}, author={B. Green}, journal={Geometric & Functional Analysis GAFA}, year={2003}, volume={15}, pages={340-376} }
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 \subseteq \{1,\ldots,N\}$$ has δ N2 triples (a1, a2, a3) for which a1 + a2 = a3 then A = B ∪ C, where B is sum-free and |C| = δ′N, and
$$\delta… Expand
205 Citations
On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs
- Mathematics
- 2014
- 6
- PDF
A counting lemma for binary matroids and applications to extremal problems
- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2019
- 1
- PDF
Testing properties of functions on finite groups
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2016
- 2
- PDF
References
SHOWING 1-10 OF 35 REFERENCES
Finite field models in additive combinatories
- Mathematics, Computer Science
- Surveys in Combinatorics
- 2005
- 127
- PDF
On subsets of abelian groups with no 3-term arithmetic progression
- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1987
- 59
- PDF
On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions
- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 1995
- 142