1 citations · 2 across the 4 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2025
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 integers can be before it is forced to contain elements forming an ari…
math.NT2024★ 1 cited
On integer distance sets
Rachel Greenfeld, Marina Iliopoulou, Sarah Peluse
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Eu…
math.NT2023★ 1 cited
Finite field models in arithmetic combinatorics -- twenty years on
Sarah Peluse
About twenty years ago, Green wrote a survey article on the utility of looking at toy versions over finite fields of problems in additive combinatorics. This article was extremely…