From Wikipedia, the free encyclopedia
Endre Szemerédi (born August 21, 1940) is a Hungarian mathematician, working in the field of combinatorics, currently professor of computer science at Rutgers University. He was born in Budapest, studied in Eötvös Loránd University in Budapest and received his PhD from Moscow State University. His advisers in mathematics were Paul Erdős and András Hajnal.
He is best known for his proof from 1975 of an old conjecture of Erdős and Paul Turán: if a sequence of natural numbers has positive upper density then it contains arbitrarily long arithmetic progressions. This is now known as Szemerédi's theorem. One of the key tools introduced in his proof is now known as the Szemerédi regularity lemma, which has become a very important tool in combinatorics. He is also known for the Szemerédi-Trotter theorem in incidence geometry and the Hajnal-Szemerédi theorem in graph theory. With A. Khalfalah and S. Lodha he proved that at most (11/32+o(1))x numbers can be given up to x such that no two add up to a perfect square.
Szemerédi was awarded the Pólya prize in 1975. He received the AMS Leroy P. Steele Prize for a Seminal Contribution to Research (2008)[1] and the Schock Prize (2008). He is a corresponding member (1982), and member (1987) of the Hungarian Academy of Sciences.
[edit] References
[edit] External links
