Szemeredi's Regularity Lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph property testing, combinatorial number theory, etc. The goal of this paper is to point out that Szemeredi's Lemma can be thought of as a result in analysis, and show some applications of analytic nature.

PDF file

Details