Finding arithmetic progressions in dense sets of integers

Sarah Peluse

One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an ari…