Arithmetic Removal Lemma
The Arithmetic Removal Lemma is a foundational result in additive combinatorics that belongs to the class of removal lemmas, distinguished by its assertion that for any finite abelian group and any subset free of nontrivial arithmetic progressions of a given length, a small number of element removals suffices to eliminate all such progressions.
10
Publications
346
Citations
17
Authors
14
Institutions
Publications per year
2017–2026
4
Parents
10
Bounds for graph regularity and removal lemmas
David Conlon, Jacob Fox · Geometric and Functional Analysis · 2012 · 96 citations
1–5 of 10
17
3
h-index
3
h-index
3
h-index
3
h-index
1
h-index
1–5 of 17
14
Charles University
Prague, Czechia
3 h-index
3 publications
156 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
5 publications
291 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
42 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
38 citations
Stanford University
Stanford, United States
2 h-index
2 publications
38 citations

University of Warwick
Coventry, United Kingdom
1 h-index
2 publications
24 citations
Princeton University
Princeton, United States
1 h-index
1 publications
10 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
1 publications
12 citations
1–8 of 14
GAFA · 1 publications · 96 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1 publications · 56 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 79 citations
1
h-index
1–5