SPSarah Peluse
Sarah Peluse
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sarah Peluse has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Sean Prendiville
Lancaster University
1 shared publication
Latest Publications
- Open Access
An asymptotic version of the prime power conjecture for perfect difference sets
We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.Open AccessAn asymptotic version of the prime power conjecture for perfect difference sets
We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$. - Open Access
A polylogarithmic bound in the nonlinear Roth theorem
We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.Open AccessA polylogarithmic bound in the nonlinear Roth theorem
We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density. - 3 May 2021
- Published by Springer Nature in Mathematische Annalen
- Vol. 380 (3-4) , 1387-1425
An asymptotic version of the prime power conjecture for perfect difference sets
- 3 May 2021
- Published by Springer Nature in Mathematische Annalen
- Vol. 380 (3-4) , 1387-1425
An asymptotic version of the prime power conjecture for perfect difference sets
- Open Access
On even entries in the character table of the symmetric group
We show that almost every entry in the character table of $S_n$ is even as $n\to\infty$. This resolves a conjecture of Miller. We similarly prove that almost every entry in the character table of $S_n$ is zero modulo $3,5,7,11,$ and $13$ as $n\to\infty$, partially addressing another conjecture of Miller.Open AccessOn even entries in the character table of the symmetric group
We show that almost every entry in the character table of $S_n$ is even as $n\to\infty$. This resolves a conjecture of Miller. We similarly prove that almost every entry in the character table of $S_n$ is zero modulo $3,5,7,11,$ and $13$ as $n\to\infty$, partially addressing another conjecture of Miller.