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
53
A polynomial bound in Freiman's theorem
Mei-Chu Chang · Duke Mathematical Journal · 2002 · 214 citations
Product set estimates for non-commutative groups
Terence Tao · COMBINATORICA · 2008 · 214 citations
1–5 of 53
52
10
h-index
8
h-index
3
h-index
3
h-index
3
h-index
1–5 of 52
49
University of California, Los Angeles
Los Angeles, United States
7 h-index
7 publications
692 citations

Hungarian Academy of Sciences
Budapest, Hungary
4 h-index
4 publications
318 citations
University of California San Diego
San Diego, United States
3 h-index
3 publications
77 citations

University of Bristol
Bristol, United Kingdom
3 h-index
3 publications
145 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
3 publications
100 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
35 citations
University of California, Riverside
Riverside, United States
2 h-index
2 publications
54 citations
Princeton University
Princeton, United States
2 h-index
2 publications
62 citations
1–8 of 49
Repository · 5 publications · 79 citations
5
h-index
4 publications · 141 citations
4
h-index
3 publications · 185 citations
3
h-index
DMJ · 3 publications · 315 citations
3
h-index
Repository · 2 publications · 39 citations
2
h-index
1–5