J. Maynard

activity

20122023

most citedVinogradov's theorem with almost equal summands

27 citations · 112 across the 25 of their papers we have counts for

collaborators

Showing 2015 · math.NTShow all

4 papers · 2 filters

math.NT2015

Chains of large gaps between primes

Kevin Ford, James Maynard, Terence Tao

Let $p_{n}$ denote the $n$ -th prime, and for any $k \geq 1$ and sufficiently large $X$ , define the quantity $$ G_k(X) := \max_{p_{n+k} \leq X} \min( p_{n+1}-p_n, \dots, p_{n+k}-p_{n+…

math.NT2015★ 14 cited

Limit points and long gaps between primes

Roger Baker, Tristan Freiberg

Let $d_{n} = p_{n + 1} - p_{n}$ , where $p_{n}$ denotes the $n$ th smallest prime, and let $R (T) = lo g T lo g_{2} T lo g_{4} T / (lo g_{3} T)^{2}$ (the "Erd{\H o}s--Rankin" function). We consider the…

math.NT2015

Primes and polynomials with restricted digits

James Maynard

Let $q$ be a sufficiently large integer, and $a_{0} \in {0, \dots, q - 1}$ . We show there are infinitely many prime numbers which do not have the digit $a_{0}$ in their base $q$ expansion.…

math.NT2015

Primes represented by incomplete norm forms

James Maynard

Let $K = Q (ω)$ with $ω$ the root of a degree $n$ monic irreducible polynomial $f \in Z [X]$ . We show the degree $n$ polynomial $N (\sum_{i = 1}^{n - k} x_{i} ω^{i - 1})$ in $n - k$ …