Note: July 1, 2010. On June 8-9 CMI held a conference in Paris to celebrate the resolution of the Poincaré conjecture by Grigoriy Perelman. Dr. Perelman has subsequently informed us that he has decided not to accept the one million dollar prize. In the fall of 2010, CMI will make an announcement of how the prize money will be used to benefit mathematics.
2010 Clay Research Conference
The Clay Mathematics held its annual Research Conference June 8 and 9, 2010 at the Institut Henri Poincaré in Paris. The conference celebrated the resolution of the Poincaré and geometrization conjectures by Grigoriy Perelman.
Here are the laudations in honor of Grigoriy Perelman.
Clay Public Lecture
Mathematics is just a tale about groups
H. Poincaré, 1881
Étienne Ghys, CNRS, École normale supérieure, Lyon
Monday, June 7, 2010 at 7:30 pm
Institut Océanographique, Paris
On May 28, 1880, Henri Poincaré submitted an extraordinary paper to the French Academy of Sciences.
First Clay Mathematics Institute Millennium Prize Announced
Prize for Resolution of the Poincaré Conjecture Awarded to Dr. Grigoriy PerelmanMarch 18, 2010
The Clay Mathematics Institute (CMI) announces today that Dr. Grigoriy Perelman of St. Petersburg, Russia, is the recipient of the Millennium Prize for resolution of the Poincaré conjecture. The citation for the award reads:
The Clay Mathematics Institute hereby awards the Millennium Prize for resolution of the Poincaré conjecture to Grigoriy Perelman.
Short Press Release | Full Press Release
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).
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