A Simple Combinatorial Proof of Szemerédi's Theorem via Three Levels of Infinities
A simple combinatorial proof of Szemerédi's theorem via three levels of infinities, Discrete Analysis 2023:15, 27 pp. Szemerédi's theorem, a cornerstone of additive combinatorics, states that for every $\delta>0$ and every positive integer $k$ there exists a positive integer $n$ such t...
Main Author: | Renling Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
Diamond Open Access Journals
2023-09-01
|
Series: | Discrete Analysis |
Online Access: | https://doi.org/10.19086/da.87772 |
Similar Items
-
Yet another proof of Szemeredi's theorem
by: Green, B, et al.
Published: (2010) -
A relative Szemerédi theorem
by: Conlon, D, et al.
Published: (2015) -
A note on the Freiman and Balog-Szemeredi-Gowers theorems in finite
fields
by: Green, B, et al.
Published: (2007) -
New bounds for Szemeredi's theorem, II: A new bound for r_4(N)
by: Green, B, et al.
Published: (2006) -
New bounds for Szemeredi's theorem. III: A polylogarithmic bound for r_4(N)
by: Green, B, et al.
Published: (2017)