Education
University of Oxford.
University of Oxford.
In November 2013, Maynard gave a different proof of Yitang Zhang"s theorem that there are bounded gaps between primes, and resolved a longstanding conjecture by showing that for any there are infinitely many intervals of bounded length containing prime numbers. This work can be seen as progress on the Hardy–Littlewood -tuples conjecture as it establishes that "a positive proportion of admissible -tuples satisfy the prime -tuples conjecture for every." Maynard"s approach yielded the upper bound
which improved significantly upon the best existing bounds due to the Polymath 8 project (In other words, he showed that there are infinitely many prime gaps at most 600) Subsequently, Polymath 8b was created, whose collaborative efforts have reduced the gap size to 252.
As of April 14, 2014, one year after Zhang"s announcement, according to the Polymath project wiki, North has been reduced to 246.
Further, assuming the Elliott–Halberstam conjecture and its generalized form, the Polymath project wiki states that North has been reduced to 12 and 6, respectively. After completing his bachelor"s and master"s degrees at Cambridge University in 2009, Maynard obtained his Doctor of Philosophy from Oxford University at Balliol College in 2013 under the supervision of Roger Heath-Brown.
Foreign the 2013–2014 year, Maynard was a Communications Resource Management-Institute for Supply Management postdoctoral researcher at the University of Montreal. In 2014, he was awarded the Shanmugha Arts Science Technology and Research Academy Ramanujan Prize.