Results 1 
5 of
5
The primes contain arbitrarily long arithmetic progressions
 Ann. of Math
"... Abstract. We prove that there are arbitrarily long arithmetic progressions of primes. ..."
Abstract

Cited by 151 (26 self)
 Add to MetaCart
Abstract. We prove that there are arbitrarily long arithmetic progressions of primes.
A quantitative ergodic theory proof of Szemerédi’s theorem
, 2004
"... A famous theorem of Szemerédi asserts that given any density 0 < δ ≤ 1 and any integer k ≥ 3, any set of integers with density δ will contain infinitely many proper arithmetic progressions of length k. For general k there are essentially four known proofs of this fact; Szemerédi’s original combin ..."
Abstract

Cited by 33 (14 self)
 Add to MetaCart
A famous theorem of Szemerédi asserts that given any density 0 < δ ≤ 1 and any integer k ≥ 3, any set of integers with density δ will contain infinitely many proper arithmetic progressions of length k. For general k there are essentially four known proofs of this fact; Szemerédi’s original combinatorial proof using the Szemerédi regularity lemma and van der Waerden’s theorem, Furstenberg’s proof using ergodic theory, Gowers’ proof using Fourier analysis and the inverse theory of additive combinatorics, and Gowers’ more recent proof using a hypergraph regularity lemma. Of these four, the ergodic theory proof is arguably the shortest, but also the least elementary, requiring in particular the use of transfinite induction (and thus the axiom of choice), decomposing a general ergodic system as the weakly mixing extension of a transfinite tower of compact extensions. Here we present a quantitative, selfcontained version of this ergodic theory proof, and which is “elementary ” in the sense that it does not require the axiom of choice, the use of infinite sets or measures, or the use of the Fourier transform or inverse theorems from additive combinatorics. It also gives explicit (but extremely poor) quantitative bounds.
Arithmetic progressions and the primes  El Escorial lectures
 Collectanea Mathematica (2006), Vol. Extra., 3788 (Proceedings of the 7th International Conference on Harmonic Analysis and Partial Differential Equations, El Escorial
"... Abstract. We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length k in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes. 1. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length k in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes. 1.
Montreal notes on quadratic Fourier analysis, preprint, Mathematics ArXiv CA/0604089
"... Abstract. These are notes to accompany four lectures that I gave at the School on additive combinatorics, held in Montréal, Québec between March 30th and April 5th 2006. My aim is to introduce “quadratic fourier analysis ” in so far as we understand it at the present time. Specifically, we will desc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. These are notes to accompany four lectures that I gave at the School on additive combinatorics, held in Montréal, Québec between March 30th and April 5th 2006. My aim is to introduce “quadratic fourier analysis ” in so far as we understand it at the present time. Specifically, we will describe “quadratic objects ” of various types and their relation to additive structures, particularly fourterm arithmetic progressions. I will focus on qualitative results, referring the reader to the literature for the many interesting quantitative questions in this theory. Thus these lectures have a distinctly “soft ” flavour in many places. Some of the notes cover unpublished work which is joint with Terence Tao. This will be published more formally at some future juncture. Topics to be covered: 1. Lecture 1