1 citations · 2 across the 4 of their papers we have counts for
4 papers
Zeros in the character table of the symmetric group
Sarah Peluse, Kannan Soundararajan
Computations of Miller and Scheinerman suggest that the vast majority of the zeros appearing in the character table of the symmetric group are of a certain special type. While we c…
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…
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…
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…