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: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
2023-09-01
|
| Series: | Discrete Analysis |
| Online Access: | https://doi.org/10.19086/da.87772 |