Freiman's Theorem

Freiman's Theorem is a foundational result in additive combinatorics that characterizes the structure of finite sets of integers with small sumset by asserting that such sets are contained in generalized arithmetic progressions of bounded dimension and size linearly commensurate with the original set.

53

Publications

2.9K

Citations

52

Authors

49

Institutions

Publications per year

2017–2026

4

Authors

52

  1. TT
    Terence Tao

    University of California, Los Angeles, United States

    10 publications · 709 citations

    10

    h-index

  2. BG
    Ben Green

    University of California, Los Angeles, United States

    8 publications · 383 citations

    8

    h-index

  3. IZ
    Imre Z. Ruzsa

    Hungarian Academy of Sciences, Hungary

    3 publications · 276 citations

    3

    h-index

  4. SL
    Shachar Lovett

    University of California San Diego, United States

    3 publications · 55 citations

    3

    h-index

  5. MC
    Mei-Chu Chang

    University of California, Riverside, United States

    3 publications · 268 citations

    3

    h-index

1–5 of 52

Venues

  1. arXiv (Cornell University)

    Repository · 5 publications · 79 citations

    5

    h-index

  2. Combinatorics Probability Computing

    4 publications · 141 citations

    4

    h-index

  3. Acta Arithmetica

    3 publications · 185 citations

    3

    h-index

  4. Duke Mathematical Journal

    DMJ · 3 publications · 315 citations

    3

    h-index

  5. ArXiv.org

    Repository · 2 publications · 39 citations

    2

    h-index

1–5