A Model Theoretic Proof of Szemerédi's Theorem

2010/02/24 by Henry Towsner, Towsner, Henry
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Logic (math.LO) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1002.4456

openalex publication_date 2010/02/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a short proof of Szemerédi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.

Related

• The ergodic and combinatorial approaches to Szemerédi's theorem
• A quantitative ergodic theory proof of Szemerédi's theorem
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Szemerédi's regularity lemma revisited
• Deducing the multidimensional Szemeredi Theorem from an infinitary removal lemma