Clay Mathematics Institute

Dedicated to increasing and disseminating mathematical knowledge

The Clay Mathematics Institute

2015 Clay Research Conference 30 September. Charles Fefferman, Mike Hopkins, Maryam Mirzakhani, Andrei Okounkov, Peter Scholze. Associated workshops:

Research Fellowships call for nominations by November 16 

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

The 2015 Clay Research award has been made jointly to Larry Guth  and Nets Katz for their solution of the Erdős distance problem and for other joint and separate contributions to combinatorial...
The first Clay Award for Dissemination of Mathematical Knowledge has been made to Étienne Ghys in recognition of his own important contributions to mathematical research and for his distinguished...