We prove an asymptotic formula for the number of primes $p\leq X$ of the form $n^2+h$ for almost all $h \leq X^{1/2-o(1)}$. We prove that, for almost all $h \leq X^{2/5}$, the number of primes satisfies a correct-order lower bound. We also show cancellation of the M\"obius function over $n^2+h$ for almost all $h
Lasse Grimmelt, Jori Merikoski, Mayank Pandey et al.· 0 citations
We prove the Gowers uniformity of the von Mangoldt function minus its Cram\'er model in all short intervals $[X,X+X^{3/5+\varepsilon}]$, improving on the work of the first and fourth authors with Shao and Tao, where the exponent was $5/8$. This also implies a local-to-global theorem for linear equations in primes in su...
Kaisa Matomaki, Mayank Pandey, Javier Pliego et al.· 2 citations· ⚡1
We prove new large value estimates for the Riemann zeta function on the critical line. For instance, we improve the upper bound on the measure of $t\in [T, 2T]$ with $|\zeta(1/2 + it)| \geq T^{1/8}$ for the first time since Hardy-Littlewood (1923). Our results imply improved upper bounds on the $k$-th moment of zeta fo...
Let $\alpha=a/q+\epsilon$ with $(a,q)=1$, $q\le N^{1/2}$ and $|\epsilon|\le 1/(qN^{1/2})$, and let $B:=\max(q,qN|\epsilon|)$. We show that \[ \Bigl|\sum_{n<N}\Lambda(n)e(n\alpha)\Bigr|\le N^{o(1)}\Bigl(\frac{N}{B^{1/2}}+N^{19/24}\Bigr). \] This improves on the classical bound of Vinogradov from 1937, which has $N^{4/5}...
James Maynard, Mayank Pandey, Maksym Radziwiłł· 2 citations· ⚡2
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.