|
This article is cited in 12 scientific papers (total in 12 papers)
Szemerédi's theorem and problems on arithmetic progressions
I. D. Shkredov M. V. Lomonosov Moscow State University
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.
Received: 27.03.2006
Citation:
I. D. Shkredov, “Szemerédi's theorem and problems on arithmetic progressions”, Russian Math. Surveys, 61:6 (2006), 1101–1166
Linking options:
https://www.mathnet.ru/eng/rm5293https://doi.org/10.1070/RM2006v061n06ABEH004370 https://www.mathnet.ru/eng/rm/v61/i6/p111
|
Statistics & downloads: |
Abstract page: | 2006 | Russian version PDF: | 1264 | English version PDF: | 55 | References: | 121 | First page: | 21 |
|