By AI Staff

James Maynard is a research professor at the University of Oxford, and was previously a postdoctoral researcher at the University of Montreal. He completed his bachelor’s and master’s degrees at University of Cambridge in 2009, and earned his Ph.D. at Oxford in 2013.

One of the youngest names among influential mathematicians, Maynard was just 26 when he came to prominence after providing a different proof to a popular theory of prime gaps at the time provided by Yitang Zhang. Indeed, Maynard is seen as a kind of specialist in prime gaps, and also solved a conjecture proposed by Paul Erdős concerning the topic. More recently, he helped prove the Duffin–Schaeffer conjecture.

For his work, Maynard has received several major awards, including the SASTRA Ramanujan Prize, the Whitehead Prize, the EMS Prize, and the Cole Prize in Number Theory.

**Featured in Top Influential Mathematicians Today**

According to Wikipedia, James Maynard is a British mathematician best known for his work on prime gaps. In 2017, he was appointed Research Professor at Oxford.Biography After completing his bachelor's and master's degrees at 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. For the 2013–2014 year, Maynard was a CRM-ISM postdoctoral researcher at the University of Montreal.

- On the difference between consecutive primes
- Small gaps between primes
- Dense clusters of primes in subsets
- Long gaps between primes
- On limit points of the sequence of normalized prime gaps
- Large gaps between primes
- Primes with restricted digits
- On the Duffin-Schaeffer conjecture
- On the Brun-Titchmarsh Theorem
- Almost-prime $k$-tuples
- Vinogradov's theorem with almost equal summands
- PRIMES REPRESENTED BY INCOMPLETE NORM FORMS
- 3-tuples have at most 7 prime factors infinitely often
- Bounded length intervals containing two primes and an almost-prime II
- Bounded length intervals containing two primes and an almost-prime
- GAPS BETWEEN PRIME NUMBERS AND PRIMES IN ARITHMETIC PROGRESSIONS
- GAPS BETWEEN PRIMES
- Sign changes of Kloosterman sums and exceptional characters
- Primes and Polynomials With Restricted Digits
- Metric theory of Weyl sums
- Chains of large gaps between primes
- Primes in arithmetic progressions to large moduli I: Fixed residue classes
- Machine-Assisted Proofs (ICM 2018 Panel)
- Primes in arithmetic progressions to large moduli II: Well-factorable estimates
- A new upper bound for sets with no square differences.
- A lower bound on the LCM of polynomial sequences
- A Linear Programming Model for Scheduling Prison Guards. Applications of Linear Programming to Operations Research. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Module 272.
- The twin prime conjecture
- Digits of primes
- Together and Alone, Closing the Prime Gap
- Sieve weights and their smoothings
- Primes in arithmetic progressions to large moduli III: Uniform residue classes
- Biber to Birtwistle
- Sums of Two Squares in Short Intervals
- Long gaps in sieved sets
- Simultaneous Small Fractional Parts of Polynomials
- Reducing the number of tests for attribute inspection systems
- Topics in analytic number theory
- MACHINE-ASSISTED PROOFS

This paper list is powered by the following services:

James Maynard is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Stay informed! Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.