Clay Mathematics Institute

Dedicated to increasing and disseminating mathematical knowledge

The Clay Mathematics Institute

2015 Clay Research Conference 30 September 2015. Charles Fefferman, Mike Hopkins, Maryam Mirzakhani, Andrei Okounkov, Peter Scholze. Associated workshops will be held during the week, 28 September - 2 October.

Millennium Problems

If it is easy to check that a solution to a problem is correct, is it also easy to solve the problem? This is the essence of the P vs NP question. Typical of the NP problems is that of the Hamiltonian Path Problem: given N cities to visit, how can one do this without visiting a city twice? If you give me a solution, I can easily check that it is correct. But I cannot so easily find a solution.

News

James Maynard has been awarded a Clay Research Fellowship.  He obtained his doctorate at Oxford in 2013 under the supervision of Roger Heath-Brown.  He is currently a Fellow by Examination...
John V Pardon has been awarded a Clay Research Fellowship.  He studied as an undergraduate at Princeton and is currently working with Yakov Eliashberg at Stanford University. His most...