2010 Summer School
CMI's 2010 summer school will be on Probability and Statistical Physics in Two and more Dimensions. It will take place from July 11 to August 7 in Buzios, Brazil. more ...
The application deadline is March 1, 2010.
Clay-Mahler Lecture Tour
This six stop lecture tour in Australia features Terry Tao, Danny Calegari and Mohammed Abouzaid.
Schedule
Aug 31-Sep 2, Melbourne
Sep 3-4, Perth
Sep 8-9, Brisbane
more...
2009 Clay Research Awards Announced
March 10, 2009. The Clay Mathematics Institute announced Jean-Loup Waldspurger, Ian Agol, Danny Calegari and David Gabai as the recipients of the 2009 Clay Research Awards. Awards were presented at the Clay Research Conference on May 4-5 at Harvard University. more....
2009 Clay Research Conference
The Clay Mathematics Institute held its 2009 Research Conference May 4-5 in Harvard Science Center, Lecture Hall E. Speakers were Herwig Hauser, Heisuke Hironaka, Peter Jones, Curtis T. McMullen, Yair Minsky, Dinakar Ramakrishnan, Kannan Soundararajan and Jean-Loup Waldspurger. more ....
Monograph Proposals
The Clay Mathematics Institute solicits manuscripts for its monograph series, published jointly with the AMS. The series publishes selected expositions of recent developments, both in emerging areas and in older subjects transformed by new insights or unifying ideas. If you are interested in submitting a manuscript, please send your project description and a draft section of the proposed manuscript (if available) to Jim Carlson, managing editor, through Vida Salahi (salahi at claymath dot org).
The Poincaré Conjecture: work of Grigory Perelman
Grigory Perelman was awarded a Fields Medal at the Madrid meeting on the International Congress of Mathematicians for "his contributions to geometry and his revolutionary insights into the analytical and geometric structure of the Ricci flow." A number of authors have written detailed expositions of Perelman's work. These papers, as well as other references, are listed here.
P vs NP Problem
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 (by car), 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 (given the methods I know) find a solution.
Workshops at CMI
CMI plans to hold four to six small Workshops each year at its offices at One Bow Street, Cambridge, Massachusetts. These will be of three to six days duration. For more information or to make a proposal, please contact Jim Carlson through his executive assistant Alagi Patel (patel at claymath dot org, 617-995-2600).
Return to top