- Corners theorem
-
In mathematics, the corners theorem is an important result, proved by Miklós Ajtai and Endre Szemerédi, of a statement in arithmetic combinatorics. It states that for every ε > 0 there exists N such that given at least εN2 points in the N × N grid {1, ..., N} × {1, ..., N}, there exists a corner, i.e., three points in the form (x, y), (x + h, y), and (x, y + h). Later Solymosi gave a simpler proof, based on the triangle removal lemma. The corners theorem implies Roth's theorem.
References
- M. Ajtai, E. Szemerédi: Sets of lattice points that form no squares, Studia Sci. Math. Hungar., 9(1974), 9–11.
- J. Solymosi: Note on a generalization of Roth's theorem, Algorithms Combin., 25, 2003,Springer, Berlin, 825–827,
External link
- Proof of the corners theorem on polymath.
Categories:- Ramsey theory
- Combinatorics
- Theorems in discrete mathematics
Wikimedia Foundation. 2010.