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

Authors

17

  1. OS
    Oriol Serra

    Universitat Politècnica de Catalunya, Spain

    3 publications · 156 citations

    3

    h-index

  2. JF
    Jacob Fox

    Massachusetts Institute of Technology, United States

    3 publications · 134 citations

    3

    h-index

  3. DK
    Daniel Král͏̌

    Charles University, Czechia

    3 publications · 156 citations

    3

    h-index

  4. LV
    Lluís Vena

    Universitat Politècnica de Catalunya, Spain

    3 publications · 156 citations

    3

    h-index

  5. JB
    József Balogh

    University of Illinois Urbana-Champaign, United States

    1 publications · 12 citations

    1

    h-index

1–5 of 17

Venues

  1. Geometric and Functional Analysis

    GAFA · 1 publications · 96 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 10 citations

    1

    h-index

  3. Israel Journal of Mathematics

    1 publications · 56 citations

    1

    h-index

  4. European Journal of Combinatorics

    1 publications · 21 citations

    1

    h-index

  5. Journal of Combinatorial Theory Series A

    1 publications · 79 citations

    1

    h-index

1–5