Results 1 
4 of
4
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.
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.
Centre de Recherches Mathématiques CRM Proceedings and Lecture Notes Volume??, 2007 Ergodic Methods in Additive Combinatorics
"... Abstract. Shortly after Szemerédi’s proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of combinatorial ergodic theory, in which problems motivated by additive co ..."
Abstract
 Add to MetaCart
Abstract. Shortly after Szemerédi’s proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of combinatorial ergodic theory, in which problems motivated by additive combinatorics are addressed kwith ergodic theory. Combinatorial ergodic theory has since produced combinatorial results, some of which have yet to be obtained by other means, and has also given a deeper understanding of the structure of measure preserving systems. We outline the ergodic theory background needed to understand these results, with an emphasis on recent developments in ergodic theory and the relation to recent developments in additive combinatorics. These notes are based on four lectures given during the School on Additive Combinatorics at the Centre de recherches mathématiques, Montreal in April, 2006. The talks were aimed at an audience without background in ergodic theory. No attempt is made to include complete proofs of all statements and often the reader is referred to the original sources. Many of the proofs included are classic, included as an indication of which ingredients play a role in the developments of the past ten years. 1. Combinatorics to ergodic theory 1.1. Szemerédi’s theorem. Answering a long standing conjecture of Erdős and Turán [11], Szemerédi [54] showed that a set E ⊂ Z with positive upper density 1 contains arbitrarily long arithmetic progressions. Soon thereafter, Furstenberg [16] gave a new proof of Szemerédi’s Theorem using ergodic theory, and this has lead to the rich field of combinatorial ergodic theory. Before describing some of the results in this subject, we motivate the use of ergodic theory for studying combinatorial problems. We start with the finite formulation of Szemerédi’s theorem: Theorem 1.1 (Szemerédi [54]). Given δ> 0 and k ∈ N, there is a function N(δ, k) such that if N> N(δ, k) and E ⊂ {1,..., N} is a subset with E  ≥ δN, then E contains an arithmetic progression of length k.
An inverse theorem for the Gowers U³(G) norm
, 2006
"... There has been much recent progress in the study of arithmetic progressions in various sets, such as dense subsets of the integers or of the primes. One key tool in these developments has been the sequence of Gowers uniformity norms U d (G), d = 1, 2, 3,... on a finite additive group G; in particul ..."
Abstract
 Add to MetaCart
There has been much recent progress in the study of arithmetic progressions in various sets, such as dense subsets of the integers or of the primes. One key tool in these developments has been the sequence of Gowers uniformity norms U d (G), d = 1, 2, 3,... on a finite additive group G; in particular, to detect arithmetic progressions of length k in G it is important to know under what circumstances the U k−1 (G) norm can be large. The U 1 (G) norm is trivial, and the U 2 (G) norm can be easily described in terms of the Fourier transform. In this paper we systematically study the U 3 (G) norm, defined for any function f: G → C on a finite additive group G by the formula