2024-10-04
On the threshold for Szemerédi’s theorem with random differences
Publication
Publication
Electronic Journal of Combinatorics , Volume 31 - Issue 4 p. P4.8:1- P4.8:17
Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemerédi’s theorem with random differences is bounded from above by N1−2/k+o(1) for length-k progressions. This improves the previous best bounds of N1−1 /⌈k/2⌉+o(1) for all odd k.
| Additional Metadata | |
|---|---|
| doi.org/10.37236/12415 | |
| Electronic Journal of Combinatorics | |
| Networks | |
| Organisation | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
|
Briët, J., & Castro-Silva, D. (2024). On the threshold for Szemerédi’s theorem with random differences. Electronic Journal of Combinatorics, 31(4), P4.8:1–P4.8:17. doi:10.37236/12415 |
|
