In mathematics, the corners theorem is an important result, proved by Miklós Ajtai and Endre Szemerédi, of a statement in arithmetic combinatorics.
With Wolfgang Paul, Nick Pippenger, and William Trotter, he established a separation between nondeterministic linear time and deterministic linear time, in the spirit of the infamous P versus NP problem.
•
Ajtai and Szemerédi proved the corners theorem, an important step toward higher dimensional generalizations of the Szemerédi theorem.
•
With Ajtai and Komlós he proved the ct2/log t upper bound for the Ramsey number R(3,t), and constructed a sorting network of optimal depth.
Paul Erdős set a $1000 prize for a question related to this number, collected by Endre Szemerédi for what has become known as Szemerédi's theorem.
Endre Szemerédi | Endre Ady | Szemerédi's theorem | Endre Johannes Cleven | Endre Granat |
The following members of the Hungarian School of Combinatorics have strongly contributed to the journal as authors, or have served as editors: Miklós Ajtai, József Beck, András Frank, Péter Frankl, Zoltán Füredi, András Hajnal, Gyula Katona, László Pyber, Miklós Simonovits, Vera Sós, Endre Szemerédi, Tamás Szőnyi, Éva Tardos, Gábor Tardos.