13 citations · 43 across the 19 of their papers we have counts for
4 papers · 1 filter
Optimal Polynomial Recurrence
Neil Lyall, Akos Magyar
Let with and $\VE>0$. We show, using Fourier analytic techniques, that if $N\geq \exp\exp(C\VE^{-1}\log\VE^{-1})$ and , then there must…
An optimal version of Sarkozy's theorem
Neil Lyall, Akos Magyar
Using Fourier analytic techniques, we prove that if $\VE>0$, $N\geq \exp\exp(C\VE^{-1}\log\VE^{-1})$ and , then there must exist such that \[\frac{|…
Simultaneous Polynomial Recurrence
Neil Lyall, Akos Magyar
Let and with and for every . We show, using Fourier analytic techniques, that for every $\VE>0…
Arithmetic Structure in Sparse Difference Sets
Mariah Hamel, Neil Lyall, Katherine Thompson +1
Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer po…