Szemerédi's theorem and problems on arithmetic progressions
Il'ya Dmitrievich Shkredov
Abstract
Il'ya Dmitrievich Shkredov
Abstract
Szemeredi'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.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Szemeredi'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.
Key concepts: Mathematics, Arithmetic, Discrete mathematics, Combinatorics