Clay Mathematics Institute New President
May 11. The Clay Mathematics Institute announces today that as of June 30, 2012, the office of its president will move from Cambridge, Massachusetts, to Oxford, UK. At that time Professor Nicholas Woodhouse of Oxford University will assume the position of president. He will succeed Professor James Carlson, formerly of the University of Utah. Carlson has held the position of president since 2003, completing two terms as president.
more ....2012 Clay Research Conference
The 2012 Clay Research Conference will be held June 18-19 (Monday and Tuesday) at Oxford University in Martin Wood Lecture Theatre of the Physics Department, in United Kingdom.
Speakers are Artur Avila, Francis Brown, Stavros Garoufalidis, Jeremy Kahn, Marc Lackenby, Vladimir Markovic and Peter Scholze.
The Clay Research Awards will be presented to: Jeremy Kahn and Vladimir Markovic.
Travel support within the UK is available for the Clay Research Conference. Please contact Julie Feskoe (feskoe (at) claymath.org) to request travel support.
2012 Clay Research Awards
CMI announces the 2012 Clay Research Awards: to Jeremy Kahn (Brown University) and Vladimir Markovic (Caltech) for their work in hyperbolic geometry:
(1) their proof that a closed hyperbolic three manifold has an essential immersed hyperbolic Riemann surface, i.e., the map on fundamental groups is injective.
(2) their solution of the Ehrenpreis conjecture: that given any two compact hyperbolic Riemann surfaces, there are finite covers of the two surfaces which are arbitrarily close in the Teichmuller metric.
2012 Clay Research Fellows
The Clay Mathematics Institute (CMI) announces the appointment of two Research Fellows, Ivan Corwin and Jack Thorne, for four and five years, respectively.
Ivan Corwin received his Ph.D. last year from
New York University under the direction of Gerard Ben Arous. He
received his BA degree from Harvard University. One part of his research has been
to compute exact formulas for the statistics of the
more ....
Mr. Thorne, who has
studied at Harvard and Princeton Universities under the direction
of Benedict Gross and Richard Taylor, will receive his Ph.D. this year
from Harvard.
more ...
2012 Clay Research Scholar
CMI announces the appointment of Roman Travkin as a Clay Research Scholar, for a period of three years. Mr. Travkin will receive his Ph.D. this year from MIT, where he has been working under the supervision of Roman Bezrukavnikov. Before coming to MIT, Travkin studied at the Independent University of Moscow; prior to that, that he competed in the all-Rusisia mathematical olympiads, receiving first place once and second place twice. In his thesis, Mr. Travkin has proved the "generic part" of the quantum geometric Langlands duality for the group GL(n) over a base field of positive characteristic. He has shown that in this context it is a twisted version of the Fourier-Mukai transform.
Clay Chair at the Institut Henri Poincaré
The Clay Mathematics Institute (CMI, Cambridge, Massachusetts) and the Institut Henri Poincaré (IHP, Paris) have announced at a press conference the establishment of the Poincaré Chair, a postdoctoral position for mathematicians in the early stages of their career. Those named to the chair will hold their position at the Institut Henri Poincaré for a term of six months to one year. The Chair is financed for a period of five years with the Clay Millennium Prize funds for resolution of the Poincaré conjecture. The conjecture was solved in the affirmative by Grigoriy Perelman, for which he was awarded the Millennium Prize in 2010. Dr. Perelman subsequently declined to accept the prize money. In establishing this chair with IHP, CMI aims to provide an exceptional opportunity for mathematicians of great promise to develop their ideas and pursue their research, just as Grigoriy Perelman was afforded such an opportunity by a fellowship at the Miller Institute in 1993-95. A public call for nominations by the Institut Henri Poincaré will be made at a later date.
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.
Return to top