Results 1  10
of
12
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.
Variance of distribution of primes in residue classes
 Quart. J. Math. Oxford Ser
, 1996
"... THE prime number theorem for arithmetic progressions tells us that, for integers a, q s = 1 with (a, q) = 1 we have ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
THE prime number theorem for arithmetic progressions tells us that, for integers a, q s = 1 with (a, q) = 1 we have
On the pair correlation of the zeros of the Riemann zetafunction
 Proc. London Math. Soc
"... In 1972 Montgomery [20, 21] introduced a new method for studying the zeros of the Riemann zetafunction. One of his main accomplishments was to determine partially the pair correlation of zeros, and to apply his results to obtain new information on multiplicity of zeros and gaps between zeros. Perha ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
In 1972 Montgomery [20, 21] introduced a new method for studying the zeros of the Riemann zetafunction. One of his main accomplishments was to determine partially the pair correlation of zeros, and to apply his results to obtain new information on multiplicity of zeros and gaps between zeros. Perhaps more
Pair Correlation of the zeros of the Riemann zeta function in longer ranges
"... In this paper, we study a more general pair correlation function, Fh(x, T), of the zeros of the Riemann zeta function. It provides information on the distribution of larger differences between the zeros. 1 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we study a more general pair correlation function, Fh(x, T), of the zeros of the Riemann zeta function. It provides information on the distribution of larger differences between the zeros. 1
Prime pairs and zeta’s zeros
, 2007
"... Abstract. There is extensive numerical support for the primepair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of π2r(x), the number of prime pairs (p, p + 2r) with p ≤ x. However, it is still not known whether there are infinitely many prime pairs with given even diffe ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. There is extensive numerical support for the primepair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of π2r(x), the number of prime pairs (p, p + 2r) with p ≤ x. However, it is still not known whether there are infinitely many prime pairs with given even difference! Using a strong hypothesis on (weighted) equidistribution of primes in arithmetic progressions, Goldston, Pintz and Yildirim have recently shown that there are infinitely many pairs of primes differing by at most sixteen. The present author uses a Tauberian approach to derive that the PPC is equivalent to specific boundary behavior of certain functions involving zeta’s complex zeros. Under Riemann’s Hypothesis (RH) and on the real axis these functions resemble paircorrelation expressions. A speculative extension of Montgomery’s classical work (1973) would imply that there must be an abundance of prime pairs. 1.
AVERAGE PRIMEPAIR COUNTING FORMULA
, 902
"... Abstract. Taking r> 0, let π2r(x) denote the number of prime pairs (p, p + 2r) with p ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. There seems to be no good conjecture for the remainders ω2r(x) = π2r(x)−2C2r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Taking r> 0, let π2r(x) denote the number of prime pairs (p, p + 2r) with p ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. There seems to be no good conjecture for the remainders ω2r(x) = π2r(x)−2C2r li2(x) that corresponds to Riemann’s formula for π(x) −li(x). However, there is a heuristic approximate formula for averages of the remainders ω2r(x) which is supported by numerical results. 1.
PRIME NUMBERS IN LOGARITHMIC INTERVALS
"... Abstract. Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p + h], where p ≤ X is a prime number and h = o(X). Then we will apply this to prove that for every λ>1/2 there exists a positive proportion of primes p ≤ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p + h], where p ≤ X is a prime number and h = o(X). Then we will apply this to prove that for every λ>1/2 there exists a positive proportion of primes p ≤ X such that the interval (p, p+λ log X] contains at least a prime number. As a consequence we improve Cheer and Goldston’s result on the size of real numbers λ> 1 with the property that there is a positive proportion of integers m ≤ X such that the interval (m, m + λ log X] contains no primes. We also prove other results concerning the moments of the gaps between consecutive primes and about the positive proportion of integers m ≤ X such that the interval (m, m + λ log X] contains at least a prime number. The last applications of these techniques are two theorems (the first one unconditional and the second one in which we assume the validity of the Riemann Hypothesis and of a form of the Montgomery pair correlation conjecture) on the positive proportion of primes p ≤ X such that the interval (p, p + λ log X] containsnoprimes. 1.
MEAN VALUE ONE OF PRIMEPAIR CONSTANTS
, 2008
"... For k> 1, r = 0 and large x, let πk 2r (x) denote the number of prime pairs (p, pk +2r) with p ≤ x. By the Bateman–Horn conjecture the function πk 2r(x) should be asymptotic to (2/k)Ck 2rli2(x), with certain specific constants Ck 2r. Heuristic arguments lead to the conjecture that these constan ..."
Abstract
 Add to MetaCart
For k> 1, r = 0 and large x, let πk 2r (x) denote the number of prime pairs (p, pk +2r) with p ≤ x. By the Bateman–Horn conjecture the function πk 2r(x) should be asymptotic to (2/k)Ck 2rli2(x), with certain specific constants Ck 2r. Heuristic arguments lead to the conjecture that these constants have mean value one, just like the Hardy–Littlewood constants C2r for prime pairs (p, p + 2r). The conjecture is supported by extensive numerical work.
LOWER BOUND FOR THE REMAINDER IN THE PRIMEPAIR CONJECTURE
, 2008
"... Taking r> 0 let π2r(x) denote the number of prime pairs (p, p + 2r) with p ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. A heuristic argument indicates that the remainder e2r(x) in this approximation cannot b ..."
Abstract
 Add to MetaCart
(Show Context)
Taking r> 0 let π2r(x) denote the number of prime pairs (p, p + 2r) with p ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. A heuristic argument indicates that the remainder e2r(x) in this approximation cannot be of lower order than x β, where β is the supremum of the real parts of zeta’s zeros. The argument also suggests an approximation for π2r(x) similar to one of Riemann for π(x).
AVERAGE PRIMEPAIR COUNTING FORMULA
, 2009
"... Taking r>0, let π2r(x) denote the number of prime pairs (p, p + 2r) withp ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. There seems to be no good conjecture for the remainders ω2r(x) =π2r(x)−2C2r li2(x) that ..."
Abstract
 Add to MetaCart
(Show Context)
Taking r>0, let π2r(x) denote the number of prime pairs (p, p + 2r) withp ≤ x. The primepair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r> 0. There seems to be no good conjecture for the remainders ω2r(x) =π2r(x)−2C2r li2(x) that corresponds to Riemann’s formula for π(x)−li(x). However, there is a heuristic approximate formula for averages of the remainders ω2r(x) which is supported by numerical results.