Results 1 
7 of
7
Higher correlations of divisor sums related to primes, II: Variations of . . .
, 2007
"... We calculate the triple correlations for the truncated divisor sum λR(n). The λR(n) behave over certain averages just as the prime counting von Mangoldt function Λ(n) does or is conjectured to do. We also calculate the mixed (with a factor of Λ(n)) correlations. The results for the moments up to the ..."
Abstract

Cited by 50 (9 self)
 Add to MetaCart
(Show Context)
We calculate the triple correlations for the truncated divisor sum λR(n). The λR(n) behave over certain averages just as the prime counting von Mangoldt function Λ(n) does or is conjectured to do. We also calculate the mixed (with a factor of Λ(n)) correlations. The results for the moments up to the third degree, and therefore the implications for the distribution of primes in short intervals, are the same as those we obtained (in the first paper with this title) by using the simpler approximation ΛR(n). However, when λR(n) is used, the error in the singular series approximation is often much smaller than what ΛR(n) allows. Assuming the Generalized Riemann Hypothesis (GRH) for Dirichlet Lfunctions, we obtain an Ω±result for the variation of the error term in the prime number theorem. Formerly, our knowledge under GRH was restricted to Ωresults for the absolute value of this variation. An important ingredient in the last part of this work is a recent result due to Montgomery and Soundararajan which makes it possible for us to dispense with a large error term in the evaluation of a certain singular series average. We believe that our results on the sums λR(n) and ΛR(n) can be employed in diverse problems concerning primes.
Primes in Tuples I
"... We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the ElliottHalberstam conjecture, we prove that there are infinitely often primes differing by 16 or less. E ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
(Show Context)
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the ElliottHalberstam conjecture, we prove that there are infinitely often primes differing by 16 or less. Even a much weaker conjecture implies that there are infinitely often primes a bounded distance apart. Unconditionally, we prove that there exist consecutive primes which are closer than any arbitrarily small multiple of the average spacing, that is, pn+1 − pn lim inf =0. n→ ∞ log pn We will quantify this result further in a later paper (see (1.9) below).
Yıldırım, Small gaps between primes or almost primes
"... Abstract. Let pn denote the nth prime. Goldston, Pintz, and Yıldırım recently proved that (pn+1 − pn) lim inf =0. n→ ∞ log pn We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of ex ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Let pn denote the nth prime. Goldston, Pintz, and Yıldırım recently proved that (pn+1 − pn) lim inf =0. n→ ∞ log pn We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of exactly two distinct primes. We prove that lim inf n→ ∞ (qn+1 − qn) ≤ 26. If an appropriate generalization of the ElliottHalberstam Conjecture is true, then the above bound can be improved to 6. 1.
Small gaps between primes
"... ABSTRACT. We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that, for any η> 0, a positive proportion of consecutive primes are within 1 + η times the average spacing betwe ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
ABSTRACT. We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that, for any η> 0, a positive proportion of consecutive primes are within 1 + η times the average spacing between primes. 4 1.
PRIMES IN TUPLES III: On the difference pn+ν − pn
"... As an approximation to the twin prime problem, Hardy and Littlewood initiated the investigation of (1.1) ∆ν: = lim inf n→∞ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
As an approximation to the twin prime problem, Hardy and Littlewood initiated the investigation of (1.1) ∆ν: = lim inf n→∞
Functiones et Approximatio XXXV (2006), 19{29 PRIMES IN TUPLES III: On the dierence pn+ pn
"... on the occasion of his 75th birthday Abstract: xxx ..."
(Show Context)