Abstract:
Szemerédi's famous theorem on arithmetic progressions asserts
that every subset of integers of positive asymptotic density
contains arithmetic progressions of arbitrary length. His
remarkable theorem has been developed into a major new area of
combinatorial number theory. This is the topic of the present survey.
This publication is cited in the following 12 articles:
V. O. Kirova, I. V. Godunov, “Kombinatornye slozhnostnye kharakteristiki slov Shturma”, Chebyshevskii sb., 24:4 (2023), 63–77
Hao Lin, Guanghui Wang, Wenling Zhou, “Integer colorings with no rainbow k-term arithmetic progression”, European Journal of Combinatorics, 104 (2022), 103547
Dumitrescu A., “Distinct Distances and Arithmetic Progressions”, Discret Appl. Math., 256:SI (2019), 38–41
Miklós Simonovits, Endre Szemerédi, Bolyai Society Mathematical Studies, 28, Building Bridges II, 2019, 445
A. S. Semchenkov, “Maximal Subsets Free of Arithmetic Progressions in Arbitrary Sets”, Math. Notes, 102:3 (2017), 396–402
I. D. Shkredov, “Structure theorems in additive combinatorics”, Russian Math. Surveys, 70:1 (2015), 113–163
D. A. Shabanov, “Van der Waerden function and colorings of hypergraphs with large girth”, Dokl. Math, 88:1 (2013), 473
Khodakhast Bibak, Springer Proceedings in Mathematics & Statistics, 43, Number Theory and Related Fields, 2013, 99
D. A. Shabanov, “Van der Waerden's function and colourings of hypergraphs”, Izv. Math., 75:5 (2011), 1063–1091
A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Russian Math. Surveys, 66:5 (2011), 933–1002
D. A. Shabanov, “On the Lower Bound for van der Waerden Functions”, Math. Notes, 87:6 (2010), 918–920
I. D. Shkredov, “Fourier analysis in combinatorial number theory”, Russian Math. Surveys, 65:3 (2010), 513–567
Citation in format AMSBIB
Contact us: