The Norwegian Academy of Science and Letters recently announced the Abel Prize for 2012 will be awarded to Endre Szemerédi.
The Abel Committee cites his "fundamental contributions to discrete mathematics and theoretical computer science" as well as the "profound and lasting impact of these contributions on additive number theory and ergodic theory."
According to the press release, "Many of his discoveries carry his name. One of the most important is Szemerédi's Theorem, which shows that in any set of integers with positive density, there are arbitrarily long arithmetic progressions. Szemerédi’s proof was a masterpiece of combinatorial reasoning, and was immediately recognized to be of exceptional depth and importance. A key step in the proof, now known as the Szemerédi Regularity Lemma, is a structural classification of large graphs."
Szemerédi is a permanent research fellow at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, in Budapest. He also serves as the New Jersey Professor of Computer Science at Rutgers University. He has received numerous awards throughout the course of his career, including the Leroy P. Steele Prize (2008); the Rolf Schock Prize in Mathematics (2008); Prize of the Hungarian Academy of Sciences (1979); Pólya Prize for Achievement in Applied Mathematics (SIAM) (1975); Rényi Prize (1973); and the Grünwald Prize (1967 and 1968).
Endre Szemerédi will receive the Abel Prize from King Harald at an award ceremony in Oslo on May 22, 2012.
For more information, visit www.abelprisen.no/en.
The Third Annual Abel Conference in honor of Szemeredi, to be held at the IMA in 2013, is currently being planned and details will be available soon on the website.