Jump to content

Endre Szemerédi

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Ceancata (talk | contribs) at 02:03, 30 October 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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. 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.

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) and the Schock Prize (2008). He is a corresponding member (1982), and member (1987) of the Hungarian Academy of Sciences.

Template:BD