#### DMCA

## Arithmetic progressions and the primes (2004)

Venue: | EL ESCORIAL LECTURES |

Citations: | 5 - 2 self |

### Citations

357 | On sets of integers containing no k elements in arithmetic progression.
- Szemeredi
- 1975
(Show Context)
Citation Context ...the cardinality of a finite set A. 38 Tao (in fact, we shall give two proofs). This theorem was then generalized substantially by Szemerédi in 1975: Theorem 1.2 (Szemerédi’s Theorem, first version) =-=[38, 39]-=- Let A ⊂ Z+ be a subset of integers with positive upper density, thus lim supN→∞ 1 N |A∩ [1, N ]| > 0, and let k > 3. Then A contains infinitely many arithmetic progressions n, n+ r, . . . , n+ (k − 1... |

268 | The primes contain arbitrarily long arithmetic progressions
- Green, Tao
(Show Context)
Citation Context ...r relatively dense subsets of primes, but relatively dense subsets of almost primes (numbers containing no small prime factors); we shall return to this point later. In 2004, Ben Green and the author =-=[23]-=- were able to extend this theorem to arbitrarily long progressions, by replacing Fourier-analytic ideas with ergodic theory ones: Theorem 1.5 [24] Let A ⊂ P be a subset of primes with positive relativ... |

258 | A new proof of Szemeredi’s theorem.
- Gowers
- 2001
(Show Context)
Citation Context ...ted results arising from ergodic theory; see [29, 47]). This concludes our discussion of Gowers’ proof of Szemerédi’s Theorem for progressions of length 4; the argument also extends to higher k (see =-=[17]-=-) though with some non-trivial additional difficulties; also, it is not at present clear whether the higher Ud norms also enjoy an inverse theorem. We now briefly discuss another proof of this theorem... |

250 |
Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions,
- Furstenberg
- 1977
(Show Context)
Citation Context ...h theory) and very complicated. A substantially shorter proof - but one involving the full machinery of measure theory and ergodic theory, as well as the axiom of choice - was obtained by Furstenberg =-=[10, 11]-=- in 1977. Since then, there have been two other types of proofs; a proof of Gowers [16, 17] in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; ... |

226 |
Some problems of ‘partitio numerorum’ III, On the expression of a number as a sum of primes
- Hardy, Littlewood
- 1922
(Show Context)
Citation Context ...is also prime. This would be implied by the statement lim inf N→∞ E(Λ(n)Λ(n+ 2) : 1 6 n 6 N) > 0. In fact Hardy and Littlewood made the stronger conjecture, the HardyLittlewood prime tuple conjecture =-=[26]-=-, which would imply the twin prime conjecture, and would indeed verify the stronger estimate E(Λ(n)Λ(n+ 2) : 1 6 n 6 N) = B2 + o(1) where B2 is the Twin prime constant B2 := ∏ p P(n, n+ 2 coprime to p... |

221 |
On certain sets of integers.
- Roth
- 1953
(Show Context)
Citation Context ...initely 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. Introduction A celebrated Theorem of Roth =-=[36]-=- in 1953 asserts: Theorem 1.1 (Roth’s Theorem, first version) [36] Let A ⊂ Z+ be a subset of integers with positive upper density, thus1 lim supN→∞ 1 N |A ∩ [1, N ]| > 0. Then A contains infinitely ma... |

167 |
der Waerden, Beweis einer baudetschen vermutung, Nieuw Archiv Wiskunde
- van
- 1927
(Show Context)
Citation Context ... theorem is the most difficult component of the argument; it uses the uniform almost periodicity control on g̃ to “color” the orbit of Tng̃ and hence Tng, and then invokes the van der Waerden Theorem =-=[44]-=- to extract arithmetic progressions from g. As such, this part of the argument can be considered to be more combinatorial than ergodic or analytic in nature. 5. Progressions in the primes There are ma... |

151 |
Hypergraph regularity and the multidimensional Szemerédi theorem
- Gowers
- 2007
(Show Context)
Citation Context ...ave been two other types of proofs; a proof of Gowers [16, 17] in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; and also arguments of Gowers =-=[18]-=- and Rödl-Skokan [34, 35] using the machinery of hypergraphs. While we will not discuss all these separate proofs in detail here, we will need to discuss certain ideas from each of these arguments as... |

150 | A new proof of Szemeredi’s theorem for arithmetic progressions of length four. Geometric and Functional Analysis,
- Gowers
- 1998
(Show Context)
Citation Context ...machinery of measure theory and ergodic theory, as well as the axiom of choice - was obtained by Furstenberg [10, 11] in 1977. Since then, there have been two other types of proofs; a proof of Gowers =-=[16, 17]-=- in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; and also arguments of Gowers [18] and Rödl-Skokan [34, 35] using the machinery of hypergra... |

125 | Polynomial extensions of van der Waerden’s and Szemeredi’s theorems, - Bergelson, Leibman - 1996 |

113 | The Theory of the Riemann Zeta Function - Titchmarsh |

108 | On some sequences of integers - Erdős, Turán - 1936 |

92 |
On triples in arithmetic progression
- Bourgain
- 1999
(Show Context)
Citation Context ...please by requiring N to be sufficiently large). The density can only increase by 7This step is not particularly efficient when it comes to quantitative constants. A more refined argument of Bourgain =-=[5]-=- works entirely with Bohr sets rather than arithmetic progressions, and obtains the best bounds onN0(δ) to date (namelyN0(δ) 6 Cδ−C/δ 2 ). Arithmetic progressions and the primes 51 c′′′δ2 by at most O... |

91 | Universal characteristic factors and Furstenberg averages,
- Ziegler
- 2007
(Show Context)
Citation Context ...b, χ〉 is somewhat large; see [25] for a rigorous statement and proof of this “inverse theorem for the U3 norm”. (Interestingly, there are some closely related results arising from ergodic theory; see =-=[29, 47]-=-). This concludes our discussion of Gowers’ proof of Szemerédi’s Theorem for progressions of length 4; the argument also extends to higher k (see [17]) though with some non-trivial additional difficu... |

90 | Regularity lemma for k-uniform hypergraphs.
- Rodl, Skokan
- 2004
(Show Context)
Citation Context ...es of proofs; a proof of Gowers [16, 17] in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; and also arguments of Gowers [18] and Rödl-Skokan =-=[34, 35]-=- using the machinery of hypergraphs. While we will not discuss all these separate proofs in detail here, we will need to discuss certain ideas from each of these arguments as they will eventually be u... |

86 | Lp estimates on the bilinear Hilbert transform for 2 < p
- Lacey, Thiele
- 1997
(Show Context)
Citation Context ...Remark 2.4 Interestingly, estimates of this type (after being suitably localized in phase space) have proven to be crucial in recent progress in understanding the bilinear Hilbert transform (see e.g. =-=[30]-=-), or at least in understanding the contribution of individual “trees” to that transform. Indeed there is some formal similarity between the trilinear form Λ3 and the trilinear form Λ(f, g, h) := p.v.... |

75 | A Szemerédi-type regularity lemma in abelian groups, with applications - Green - 2005 |

69 |
On sets of integers containing no four elements in arithmetic progression.
- Szemeredi
- 1969
(Show Context)
Citation Context ...the cardinality of a finite set A. 38 Tao (in fact, we shall give two proofs). This theorem was then generalized substantially by Szemerédi in 1975: Theorem 1.2 (Szemerédi’s Theorem, first version) =-=[38, 39]-=- Let A ⊂ Z+ be a subset of integers with positive upper density, thus lim supN→∞ 1 N |A∩ [1, N ]| > 0, and let k > 3. Then A contains infinitely many arithmetic progressions n, n+ r, . . . , n+ (k − 1... |

67 |
On certain sets of positive density
- Varnavides
- 1959
(Show Context)
Citation Context ...ogression of length three in A. (In fact we have demonstrated > c′(3, δ)N2 such progressions for some c′(3, δ) > 0). Proof. [Second version implies third version] This argument is due to Varnavides =-=[45]-=-. We first observe that to prove the theorem, it suffices to do so when f is a characteristic function f = 1A. This is because if f is non-negative, bounded and obeys (2.1) then the set A := {n ∈ Z/NZ... |

64 |
Representation of an odd number as a sum of three primes, Dokl. Akad
- Vinogradov
(Show Context)
Citation Context ... the prime tuple conjecture would imply the strong Goldbach conjecture for sufficiently large N . The weak Goldbach conjecture, which is essentially proven (thanks primarily to the work of Vinogradov =-=[46]-=-), asserts that every odd number N larger than 5 can be written as the sum of three primes. (By “essentially proven” I mean that this conjecture has been verified for N 6 1017 and also rigorously prov... |

55 | A quantitative ergodic theory proof of Szemeredi’s theorem,
- Tao
- 2006
(Show Context)
Citation Context ...Roth’s Theorem] We now give an energy increment proof of Roth’s Theorem, inspired by arguments of Furstenberg [10], Bourgain [4], and Green [20], as well as later arguments by Green and the author in =-=[24, 41]-=-. This is not the shortest such proof, nor the most efficient as far as explicit bounds are concerned, but it is a proof which has a relatively small reliance on Fourier analysis and thus generalizes ... |

52 | Roth’s theorem in the primes
- Green
(Show Context)
Citation Context ...ength three, but also to obtain an asymptotic count as to how many such progressions there are; we shall return to this point later. Roth’s Theorem and van der Corput’s Theorem were combined by Green =-=[20]-=- in 2003 to obtain Arithmetic progressions and the primes 39 Theorem 1.4 (Green’s Theorem) [20] Let A ⊂ P be a subset of primes with positive relative upper density: lim sup N→∞ |A ∩ [1, N ]| |P ∩ [1,... |

45 | The ergodic theoretical proof of Szemeredi’s theorem,
- Furstenberg, Katznelson, et al.
- 1982
(Show Context)
Citation Context ...h theory) and very complicated. A substantially shorter proof - but one involving the full machinery of measure theory and ergodic theory, as well as the axiom of choice - was obtained by Furstenberg =-=[10, 11]-=- in 1977. Since then, there have been two other types of proofs; a proof of Gowers [16, 17] in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; ... |

45 | Yildirim Higher correlations of divisor sums related to primes, I: Triple correlations
- Goldston, Y
(Show Context)
Citation Context ...1PR is a bit too “rough” to serve as a good weight function, and it is better to use a slightly “smoother” variant of this function, namely the truncated divisor sums studied by Goldston and Yildirim =-=[13, 14, 15]-=-. These are formed by replacing the von Mangoldt function Λ(n) = ∑ d|n µ(d) log n d with the variant ΛR(n) := ∑ d|n µ(d) ( log R d ) + where x+ := max(x, 0) is the positive part of x. One can easily v... |

45 | Applications of the regularity lemma for uniform hypergraphs,
- Rodl, Skokan
- 2006
(Show Context)
Citation Context ...es of proofs; a proof of Gowers [16, 17] in 2001 which combines “higher order” Fourier analytic methods with techniques from additive combinatorics; and also arguments of Gowers [18] and Rödl-Skokan =-=[34, 35]-=- using the machinery of hypergraphs. While we will not discuss all these separate proofs in detail here, we will need to discuss certain ideas from each of these arguments as they will eventually be u... |

40 | Multidimensional van der Corput and sublevel set estimates
- Carbery, Christ, et al.
- 1999
(Show Context)
Citation Context ...K‖1 = |E(K(x)|x ∈ A1)| which is degenerate and thus not a genuine norm. The significance of the Gowers cube norm to expressions of the form (3.1) lies in the following estimate (which is implicit in =-=[6]-=- and also in [17]). Arithmetic progressions and the primes 59 Lemma 3.1 (van der Corput Lemma) Let d > 1, let A1, . . . , Ad be finite non-empty sets, let K : ∏d j=1Aj → C, and for each 1 6 i 6 d let ... |

38 |
A Szemerédi type theorem for sets of positive density in Rk
- Bourgain
- 1986
(Show Context)
Citation Context ...ivial arithmetic of length three in A. Proof. [Energy increment proof of Roth’s Theorem] We now give an energy increment proof of Roth’s Theorem, inspired by arguments of Furstenberg [10], Bourgain =-=[4]-=-, and Green [20], as well as later arguments by Green and the author in [24, 41]. This is not the shortest such proof, nor the most efficient as far as explicit bounds are concerned, but it is a proof... |

35 | Restriction theory of the Selberg sieve, with applications,
- Green, Tao
- 2006
(Show Context)
Citation Context ...on with (7.4)) to show that the algorithm to find B halts after only a bounded number of iterations. We now briefly remark on the earlier k = 3 versions of the above argument, referring the reader to =-=[20, 24]-=- for further details. In that case, the notion of pseudorandomness of the dominating measure ν was replaced by that of linear pseudorandomness or Fourier pseudorandomness, which basically asserts that... |

29 |
der Corput, Über Summen von Primzahlen und Primzahlquadraten
- van
- 1939
(Show Context)
Citation Context ...s they will eventually be used in the proof of Theorem 5.1 below. The above theorems do not apply directly to the set of prime numbers, as they have density zero. Nevertheless, in 1939 van der Corput =-=[43]-=- proved, by using Fourier analytic methods (the Hardy-Littlewood circle method) which were somewhat similar to the methods used by Roth, the following result: Theorem 1.3 (Van der Corput’s Theorem) [4... |

28 |
A note on a question of Erdös and
- Solymosi
(Show Context)
Citation Context ...based on density increment arguments and extremely large cubes (see [19]), and an argument based on the Szemerédi regularity lemma (which in turn requires energy increment arguments in the proof) in =-=[37]-=-. While these arguments are also important to the theory and both have generalizations to higher k, we will not discuss them here due to lack of space. 3. Interlude on multilinear operators We will sh... |

28 | The theory of the Riemann zeta-function. The Clarendon Press Oxford - Titchmarsh - 1986 |

26 | A non-conventional ergodic theorem for a nilsystem, Ergodic Theory and Dynam.
- Ziegler
- 2005
(Show Context)
Citation Context ...e still do not have a satisfactory theory of what a “quadratically quasiperiodic function” should be, although there are some very promising developments in the ergodic theory of nilfactors (see e.g. =-=[29, 47, 48]-=-) which should shed light on this question very soon. However, it is well understood by now how to generalize the more general concept of an almost periodic function. In ergodic theory, a function f i... |

24 |
An inverse theorem for the Gowers U3 norm
- Green, Tao
(Show Context)
Citation Context ...oximately equal to a higher-dimensional linear function to again deduce a density increment of A on some subprogression. This is again done mainly by Weyl’s theory of uniform distribution; however in =-=[25]-=- an alternate argument was developed, which is based on locating a primitive F to a. This argument closely mimics the one given in the one-dimensional case when a(h) ≈ αh+β; however, there is an addit... |

23 | Pointwise convergence of ergodic averages along cubes, preprint
- Assani
(Show Context)
Citation Context ... > 1 be a prime integer. Let f : Z/NZ → {x ∈ R : 0 6 x 6 1} be a non-negative bounded function with large mean E(f(n)|n ∈ Z/NZ) > δ. (2.1) Then we have E(f(n)f(n+ r)f(n+ 2r)|n, r ∈ Z/NZ) > c(3, δ)− oδ=-=(1)-=- (2.2) for some c(3, δ) > 0 depending only on δ, where oδ(1) is a quantity that depends on δ and N , and for each fixed δ tends to zero as N goes to infinity. Before we prove any of these versions, le... |

23 |
Quasi-random subsets of Zn
- Chang, Graham
- 1992
(Show Context)
Citation Context ...e `2 norm). Thus one can view the d norm as a multilinear generalization of the `4 Schatten-von Neumann norm. This norm has also arisen in the study of pseudorandom sets and graphs, see for instance =-=[8]-=-. Now we specialize to the problem of counting arithmetic progressions in Z/NZ. Definition 3.3 (Gowers uniformity norm) Let f : Z/NZ → C be a function and d > 1. Then we define the Gowers uniformity n... |

15 | relations amongst sums of two squares, Number theory and algebraic geometry — to Peter Swinnerton-Dyer on his 75th birthday, CUP - Linear - 2003 |

12 | A mean ergodic theorem for 1/N ∑N n=1 f(T nx)g(T n2x), Convergence in ergodic theory and probability - Furstenberg, Weiss - 1993 |

11 | Additive properties of dense subsets of sifted sequences - Ramaré, Ruzsa |

10 | Yldrm, Small gaps between primes
- Goldston, Y
(Show Context)
Citation Context ...1PR is a bit too “rough” to serve as a good weight function, and it is better to use a slightly “smoother” variant of this function, namely the truncated divisor sums studied by Goldston and Yildirim =-=[13, 14, 15]-=-. These are formed by replacing the von Mangoldt function Λ(n) = ∑ d|n µ(d) log n d with the variant ΛR(n) := ∑ d|n µ(d) ( log R d ) + where x+ := max(x, 0) is the positive part of x. One can easily v... |

10 | Three primes and an almost prime in arithmetic progression - Heath-Brown - 1981 |

9 |
Linear equations in primes, Mathematika 39
- Balog
- 1992
(Show Context)
Citation Context ...ese multilinear averages (the “rank one” averages involving three or more copies of Λ) can be treated by Fourier methods; this includes Vinogradov’s theorem and van der Corput’s theorem, and see also =-=[2]-=- for further discussion. However, it is by now well established that these techniques cannot directly extend to handle other multilinear averages. The k = 4 result in Theorem 5.1 requires a “quadratic... |

9 | Finite field models in arithmetic combinatorics
- Green
(Show Context)
Citation Context ...le to Fourier analysis and “quadratic Fourier analysis” respectively. Then we discuss the recent extension of these theorems to the prime numbers. There is substantial overlap between this survey and =-=[22]-=-. 2. Progressions of length three We now discuss some proofs of Roth’s Theorem. We first observe that this theorem can be reformulated in one of two equivalent “finitary” 40 Tao settings: firstly as a... |

8 |
There exists an infinity of 3—combinations of primes
- Chowla
- 1944
(Show Context)
Citation Context ...hall explain later, the k = 2 case is much more difficult and well beyond the reach of existing techniques. Now we turn to arithmetic progressions in the primes. In 1933 van der Corput [43] (see also =-=[7]-=-) established that the primes contain infinitely many arithmetic progressions of length 3; indeed we know the Arithmetic progressions and the primes 75 significantly stronger statement that the Hardy-... |

8 | Twenty-two primes in arithmetic progression - Moran, Pritchard, et al. - 1995 |

8 | ergodic averages and nilmanifolds, - Nonconventional - 2005 |

8 | On Snirel’man’s constant, Ann - Ramaré - 1995 |

7 | On Snirelman’s constant, Ann. Scuola Norm - Ramaré - 1995 |

6 | A mean ergodic theorem for 1/N ∑N n=1 f(Tnx)g(Tn x), Convergence in ergodic theory and probability - Furstenberg, Weiss - 1993 |

6 | Roth’s theorem in the primes, preprint - Green |

6 | An inverse theorem for the Gowers U3 norm, preprint - Green, Tao |

5 | A Szemerédi-type theorem for sets of positive density in R k - Bourgain - 1986 |

5 | The ergodic-theoretical proof of Szemerédi’s theorem - Furstenberg, Katznelson, et al. - 1982 |

5 | gaps between primes - Small |

3 | Regular partitions of graphs, Colloq - Szemerédi - 1978 |

3 | correlations of divisor sums related to primes, III: k-correlations, preprint (available at AIM preprints - Higher |

1 |
Non-conventional ergodic averages and nilmanifolds
- Heath-Brown
(Show Context)
Citation Context ...b, χ〉 is somewhat large; see [25] for a rigorous statement and proof of this “inverse theorem for the U3 norm”. (Interestingly, there are some closely related results arising from ergodic theory; see =-=[29, 47]-=-). This concludes our discussion of Gowers’ proof of Szemerédi’s Theorem for progressions of length 4; the argument also extends to higher k (see [17]) though with some non-trivial additional difficu... |