Szemerédi's theorem: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
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... |
(No difference)
|
Revision as of 10:17, 14 February 2009
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.
