Szemerédi's theorem

From Polymath Wiki
Revision as of 09:17, 14 February 2009 by Teorth (talk | contribs) (New page: '''Szemerédi's theorem''' Any subset of the integers of positive upper density contains arbitrarily long arithmetic progressions. This implies Roth's theorem. The result was [[Szem...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Szemerédi's theorem Any subset of the integers of positive upper density contains arbitrarily long arithmetic progressions.

This implies Roth's theorem. The result was first proven by Szemerédi in 1975.

See also the Wikipedia entry for this theorem, or the Scholarpedia entry.