The Green-Tao theorem: an exposition (Q489922): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Proofs from THE BOOK / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-random graphs / rank | |||
Normal rank |
Revision as of 12:41, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Green-Tao theorem: an exposition |
scientific article |
Statements
The Green-Tao theorem: an exposition (English)
0 references
21 January 2015
0 references
The beautiful theorem of \textit{B. Green} and \textit{T. Tao} [Ann. Math. (2) 167, No. 2, 481--547 (2008; Zbl 1191.11025)] says that the primes contain arithmetic progressions of any length. The authors give a short and clear exposition of the proof, incorporating simplifications of Gowers, Reingold, Trevisen, Tulisioni and Vodhon, Tao and their-selves. Some connections with graph/hypergraph theory are discussed.
0 references
Green-Tao theorem
0 references
primes in arithmetic progression
0 references
transferring principle
0 references