Fields Medals 2022

[charybdis]

...have been awarded to Hugo Duminil-Copin, June Huh, James Maynard and Maryna Viazovska.
No surprises here, unlike in 2018.
Huh's award is further proof that the best way to win a Fields Medal in combinatorics is to connect it to other disciplines.

Maynard is the one whose work will be most familiar to readers of this forum. He is most well-known for his proof that there are infinitely many pairs of primes separated by at most 600, but he has many other important and interesting results about prime numbers - for example he has proved that for every digit there are infinitely many primes that do not contain that digit.

[MattcAnderson]

The bounded gaps between primes theorem can be seen here.
https://asone.ai/polymath/index.php?...between_primes

The best result is that there are an infinite number of pairs of primes that differ by at most 246.
Maynard's result of 600 is good, but not the best so far.
Have a nice day.
Matt

[charybdis]

Originally Posted by MattcAnderson

The best result is that there are an infinite number of pairs of primes that differ by at most 246.
Maynard's result of 600 is good, but not the best so far.
Have a nice day.
Matt

Maynard's 600 was the best known bound at the time, and all the subsequent better bounds from Polymath were based on his work. His paper was also the first to show there are interval sizes that must contain 3, 4, 5... primes infinitely often.

[pinhodecarlos]

https://youtu.be/qyctvtlIKu8

Public lecture by James Maynard.

[firejuggler]

I remembered a (then blog) page by Terrence tao on the subject from 2013.
The math is beyond me.
https://terrytao.wordpress.com/2013/...after-maynard/