Results 1  10
of
19
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 150 (26 self)
 Add to MetaCart
Abstract. We prove that there are arbitrarily long arithmetic progressions of primes.
Linear equations in primes
 Annals of Mathematics
"... Abstract. Consider a system Ψ of nonconstant affinelinear forms ψ1,..., ψt: Z d → Z, no two of which are linearly dependent. Let N be a large integer, and let K ⊆ [−N, N] d be convex. A generalisation of a famous and difficult open conjecture of Hardy and Littlewood predicts an asymptotic, as N → ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Abstract. Consider a system Ψ of nonconstant affinelinear forms ψ1,..., ψt: Z d → Z, no two of which are linearly dependent. Let N be a large integer, and let K ⊆ [−N, N] d be convex. A generalisation of a famous and difficult open conjecture of Hardy and Littlewood predicts an asymptotic, as N → ∞, for the number of integer points n ∈ Z d ∩ K for which the integers ψ1(n),..., ψt(n) are simultaneously prime. This implies many other wellknown conjectures, such as the twin prime conjecture and the (weak) Goldbach conjecture. It also allows one to count the number of solutions in a convex range to any simultaneous linear system of equations, in which all unknowns are required to be prime. In this paper we (conditionally) verify this asymptotic under the assumption that no two of the affinelinear forms ψ1,..., ψt are affinely related; this excludes the important “binary ” cases such as the twin prime or Goldbach conjectures, but does allow one to count “nondegenerate ” configurations such as arithmetic progressions. Our result assumes two families of conjectures, which we term the inverse Gowersnorm conjecture (GI(s)) and the Möbius and nilsequences conjecture (MN(s)), where s ∈ {1, 2,...} is
The GreenTao Theorem on arithmetic progressions in the primes: an ergodic point of view
, 2005
"... A longstanding and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput, who showed in 1939 that there are infinitely many triples of primes in arithmetic progression. In an a ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
A longstanding and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput, who showed in 1939 that there are infinitely many triples of primes in arithmetic progression. In an amazing fusion of methods from analytic number theory and ergodic theory, Ben Green and Terence Tao showed that for any positive integer k, there exist infinitely many arithmetic progressions of length k consisting only of prime numbers. This is an introduction to some of the ideas in the proof, concentrating on the connections to ergodic theory.
Obstructions to uniformity, and arithmetic patterns in the primes, preprint
"... 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 in [26] that the primes contain arbitrarily long arithmetic progressions. One of the driving philosophies is to iden ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
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 in [26] 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. 1.
Quadratic uniformity of the Möbius function
, 2005
"... Abstract. This paper is a part of our programme to generalise the HardyLittlewood method to handle systems of linear questions in primes. This programme is laid out in our paper Linear equations in primes [14]. In particular, the results of this paper may be used, together with the machinery of [14 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. This paper is a part of our programme to generalise the HardyLittlewood method to handle systems of linear questions in primes. This programme is laid out in our paper Linear equations in primes [14]. In particular, the results of this paper may be used, together with the machinery of [14], to establish an asymptotic for the number of fourterm progressions p1 < p2 < p3 < p4 � N of primes, and more generally any problem counting prime points inside a “nondegenerate ” affine lattice of codimension at most 2. The main result of this paper is a proof of the Möbius and Nilsequences Conjecture for 1 and 2step nilsequences. This conjecture is introduced in [14] and amounts to showing that if G/Γ is an sstep nilmanifold, s � 2, if F: G/Γ → [−1, 1] is a Lipschitz function, and if Tg: G/Γ → G/Γ is the action of g ∈ G on G/Γ, then
What is good mathematics
, 2007
"... Abstract. Some personal thoughts and opinions on what “good quality mathematics” is, and whether one should try to define this term rigorously. As a case study, the story of Szemerédi’s theorem is presented. 1. The many aspects of mathematical quality We all agree that mathematicians should strive t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Some personal thoughts and opinions on what “good quality mathematics” is, and whether one should try to define this term rigorously. As a case study, the story of Szemerédi’s theorem is presented. 1. The many aspects of mathematical quality We all agree that mathematicians should strive to produce good mathematics. But how does one define “good mathematics”, and should one even dare to try at all? Let us first consider the former question. Almost immediately one realises that there are many different types of mathematics which could be designated “good”. For instance, “good mathematics ” could refer (in no particular order) to (i) Good mathematical problemsolving (e.g. a major breakthrough on an important mathematical problem); (ii) Good mathematical technique (e.g. a masterful use of existing methods, or the development of new tools); (iii) Good mathematical theory (e.g. a conceptual framework or choice of notation which systematically unifies and generalises an existing body of results);
TERNARY GOLDBACH PROBLEM FOR THE SUBSETS OF PRIMES WITH POSITIVE RELATIVE DENSITIES
, 2007
"... Abstract. Let P denote the set of all primes. Suppose that P1, P2, P3 are three subsets of P with d P (P1) + d P (P2) + d P (P3)> 2, where d P (Pi) is the lower density of Pi relative to P. We prove that for sufficiently large odd integer n, there exist pi ∈ Pi such that n = p1 + p2 + p3. 1. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. Let P denote the set of all primes. Suppose that P1, P2, P3 are three subsets of P with d P (P1) + d P (P2) + d P (P3)> 2, where d P (Pi) is the lower density of Pi relative to P. We prove that for sufficiently large odd integer n, there exist pi ∈ Pi such that n = p1 + p2 + p3. 1.
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.
Long arithmetic progressions of primes
 Mathematics Proceedings
"... Abstract. This is an article for a general mathematical audience on the author’s work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. 1. introduction and history This is a description of recent work of the author and Terence Tao [11] on primes ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. This is an article for a general mathematical audience on the author’s work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. 1. introduction and history This is a description of recent work of the author and Terence Tao [11] on primes in arithmetic progression. It is based on seminars given for a general mathematical
Frobenius Problem for Semigroups S (d1, d2, d3)
, 2008
"... The matrix representation of the set ∆(d 3), d 3 = (d1, d2, d3), of the integers which are unrepresentable by d1, d2, d3 is found. The diagrammatic procedure of calculation of the generating function Φ ( d 3; z) for the set ∆(d 3) is developed. The Frobenius number F ( d 3) , genus G ( d 3) and Hilb ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The matrix representation of the set ∆(d 3), d 3 = (d1, d2, d3), of the integers which are unrepresentable by d1, d2, d3 is found. The diagrammatic procedure of calculation of the generating function Φ ( d 3; z) for the set ∆(d 3) is developed. The Frobenius number F ( d 3) , genus G ( d 3) and Hilbert series H(d 3; z) of a graded subring for non–symmetric and symmetric semigroups S ( d 3) are found. The upper bound for the number of non–zero coefficients in the polynomial numerators of Hilbert series H(d m; z) of graded subrings for non–symmetric semigroups S (d m) of dimension, m ≥ 4, is established.