A Model Theoretic Proof of Szemerédi's Theorem

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.

Cited by in corpus (1)

• Additive combinatorics with a view towards computer science and cryptography: An exposition