7 citations · 7 across the 1 of their papers we have counts for
1 paper · 1 filter
Ben Green
The study of many problems in additive combinatorics, such as Szemerédi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for s…