Obstructions to uniformity and arithmetic patterns in the primes

From MaRDI portal
Publication:851471

DOI10.4310/PAMQ.2006.V2.N2.A2zbMATH Open1105.11032arXivmath/0505402OpenAlexW2963148321WikidataQ30052197 ScholiaQ30052197MaRDI QIDQ851471FDOQ851471


Authors: Terence Tao Edit this on Wikidata


Publication date: 21 November 2006

Published in: Pure and Applied Mathematics Quarterly (Search for Journal in Brave)

Abstract: In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions. One of the driving philosophies is to identify precisely what the obstructions could be that prevent the primes (or any other set) from behaving ``randomly, and then either show that the obstructions do not actually occur, or else convert the obstructions into usable structural information on the primes.


Full work available at URL: https://arxiv.org/abs/math/0505402




Recommendations





Cited In (10)





This page was built for publication: Obstructions to uniformity and arithmetic patterns in the primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851471)