2006Russian Mathematical SurveysRequires access

Szemerédi's theorem and problems on arithmetic progressions

Il'ya Dmitrievich Shkredov

Open publisher page 16 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Mathematics, Arithmetic, Discrete mathematics, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Szemerédi's theorem and problems on arithmetic progressions — Research Paper | ScholarLens