James Maynard (mathematician)

Maynard attended King Edward VI Grammar School, Chelmsford in Chelmsford, England. Then after completing his bachelor's and master's degrees at Queens' College, University of Cambridge in 2009, Maynard obtained his D.Phil. from University of Oxford at Balliol College in 2013 under the supervision of Roger Heath-Brown.[5][1] He then became a Fellow by Examination at Magdalen College, Oxford.[6]

For the 2013–2014 year, Maynard was a CRM-ISM postdoctoral researcher at the University of Montreal.[7]

In November 2013, Maynard gave a different proof of Yitang Zhang's theorem[8] that there are bounded gaps between primes, and resolved a longstanding conjecture by showing that for any ${\displaystyle m}$ there are infinitely many intervals of bounded length containing ${\displaystyle m}$ prime numbers.[9] This work can be seen as progress on the Hardy–Littlewood ${\displaystyle m}$-tuples conjecture as it establishes that "a positive proportion of admissible ${\displaystyle m}$-tuples satisfy the prime ${\displaystyle m}$-tuples conjecture for every ${\displaystyle m}$."[10] Maynard's approach yielded the upper bound, with ${\displaystyle p_{n}}$ denoting the ${\displaystyle n}$'th prime number,

${\displaystyle \liminf _{n\to \infty }\left(p_{n+1}-p_{n}\right)\leq 600,}$

which improved significantly upon the best existing bounds due to the Polymath8 project.[11] (In other words, he showed that there are infinitely many prime gaps with size of at most 600.) Subsequently, Polymath8b was created,[12] whose collaborative efforts have reduced the gap size to 246, according to an announcement on 14 April 2014 by the Polymath project wiki.[11] Further, assuming the Elliott–Halberstam conjecture and, separately, its generalised form, the Polymath project wiki states that the gap size has been reduced to 12 and 6, respectively.[11]

In August 2014, Maynard (independently of Ford, Green, Konyagin and Tao) resolved a longstanding conjecture of Erdős on large gaps between primes, and received the largest Erdős prize ($10,000) ever offered.[13][14]

In 2014, he was awarded the SASTRA Ramanujan Prize.[1][15] In 2015, he was awarded a Whitehead Prize[16] and in 2016 an EMS Prize.[17]

In 2016, he showed that, for any given decimal digit, there are infinitely many prime numbers that do not have that digit in their decimal expansion.[18][19]

In 2019, together with Dimitris Koukoulopoulos, he proved the Duffin–Schaeffer conjecture.[20][21]

In 2020, in joint work with Thomas Bloom, he improved the best-known bound for square-difference-free sets, showing that a set ${\displaystyle A\subset [N]}$ with no square difference has size at most ${\displaystyle {\frac {N}{(\log N)^{c\log \log \log N}}}}$ for some ${\displaystyle c>0}$.[22][23]

Maynard was awarded the Fields Medal 2022 for "contributions to analytic number theory, which have led to major advances in the understanding of the structure of prime numbers and in Diophantine approximation".[24]

Maynard was elected a Fellow of the Royal Society (FRS) in 2023.[25]

Maynard was born on 10 June 1987 in Chelmsford, England.[1] His partner is Eleanor Grant, a medical doctor. They have a son.[4][26]

• Maynard interviewed by Brady Haran on the Twin Prime Conjecture
• Maynard interviewed by Brady Haran on the completion of the Duffin-Schaeffer Conjecture
• James Maynard publications indexed by Google Scholar