Results 1  10
of
12
Prime Number Races
 Amer. Math. Monthly
"... 1. INTRODUCTION. There’s nothing quite like a day at the races....The quickening of the pulse as the starter’s pistol sounds, the thrill when your favorite contestant speeds out into the lead (or the distress if another contestant dashes out ahead of yours), and the accompanying fear (or hope) that ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
1. INTRODUCTION. There’s nothing quite like a day at the races....The quickening of the pulse as the starter’s pistol sounds, the thrill when your favorite contestant speeds out into the lead (or the distress if another contestant dashes out ahead of yours), and the accompanying fear (or hope) that the leader might change. And what if the race is a marathon? Maybe one of the contestants will be far stronger than the others, taking
The distribution of the summatory function of the Möbius function
 Lond. Math Soc
, 2004
"... Let the summatory function of the Möbius function be denoted M(x). We deduce in this article conditional results concerning M(x) assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the Riemann zeta function. The main results shown are that the weak Mertens ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Let the summatory function of the Möbius function be denoted M(x). We deduce in this article conditional results concerning M(x) assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the Riemann zeta function. The main results shown are that the weak Mertens conjecture and the existence of a limiting distribution of e −y/2 M(e y) are consequences of the aforementioned conjectures. By probabilistic techniques, we present an argument that suggests M(x) grows as large positive and large negative as a constant times ± √ x(log log log x) 5 4 infinitely often, thus providing evidence for an unpublished conjecture of Gonek’s. 1
The fourth moment of ζ ′ (ρ)
, 2008
"... Discrete moments of the Riemann zeta function were studied by Gonek and Hejhal in the 1980’s. They independently formulated a conjecture concerning the size of these moments. In 1999, Hughes, Keating, and O’Connell, by employing a random matrix model, made this conjecture more precise. Subject to th ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
Discrete moments of the Riemann zeta function were studied by Gonek and Hejhal in the 1980’s. They independently formulated a conjecture concerning the size of these moments. In 1999, Hughes, Keating, and O’Connell, by employing a random matrix model, made this conjecture more precise. Subject to the Riemann hypothesis, we establish upper and lower bounds of the correct order of magnitude in the case of the fourth moment. 1
LIMITING DISTRIBUTIONS OF THE CLASSICAL ERROR TERMS OF PRIME NUMBER THEORY
, 1306
"... ABSTRACT. Let φ: [0,∞) → R and let y0 be a nonnegative constant. Let (λn)n∈N be a nondecreasing sequence of positive numbers which tends to infinity, let(rn)n∈N be a complex sequence, andcareal number. Assume thatφis squareintegrable on[0,y0] and fory ≥ y0,φcan be expressed as φ(y) = c+ℜ for any ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
ABSTRACT. Let φ: [0,∞) → R and let y0 be a nonnegative constant. Let (λn)n∈N be a nondecreasing sequence of positive numbers which tends to infinity, let(rn)n∈N be a complex sequence, andcareal number. Assume thatφis squareintegrable on[0,y0] and fory ≥ y0,φcan be expressed as φ(y) = c+ℜ for anyX ≥ X0> 0 whereE(y,X) satisfies 1 lim Y→ ∞ Y λn≤X rne iλny)
The distribution of weighted sums of the Liouville function and Pólya’s conjecture
 Journal of Number Theory
"... ar ..."
P (3> 1mod4)=0.9959280...,
, 2006
"... How do we quantify irregularities in the distribution of prime numbers? Define where gcd(a, q) = 1. A wellknown result: πq,a(n) =#{p ≤ n: p ≡ a mod q} ln(n) lim n→ ∞ n πq,a(n) = 1 ϕ(q) informs us that primes are asymptotically equidistributed modulo q, whereϕ(q) is the Euler totient. There is, ho ..."
Abstract
 Add to MetaCart
(Show Context)
How do we quantify irregularities in the distribution of prime numbers? Define where gcd(a, q) = 1. A wellknown result: πq,a(n) =#{p ≤ n: p ≡ a mod q} ln(n) lim n→ ∞ n πq,a(n) = 1 ϕ(q) informs us that primes are asymptotically equidistributed modulo q, whereϕ(q) is the Euler totient. There is, however, unrest beneath the surface of such symmetry. For fixed a1, a1,..., ar and q, define
unknown title
, 2002
"... This note summarizes the part of my CMS doctoral prize lecture that focussed on the summatory function of the Möbius function. The lecture was titled “Limiting distributions and zeros of Artin Lfunctions ” and was presented in Toronto at the CMS Winter meeting in December 2001. I wish to thank the ..."
Abstract
 Add to MetaCart
This note summarizes the part of my CMS doctoral prize lecture that focussed on the summatory function of the Möbius function. The lecture was titled “Limiting distributions and zeros of Artin Lfunctions ” and was presented in Toronto at the CMS Winter meeting in December 2001. I wish to thank the Canadian Mathematical Society for the honour of being chosen as the recipient of the 2001 CMS doctoral prize. I would like to thank my supervisor, Professor David Boyd, who diligently guided me, generously gave of his time, and shared of his extensive knowledge of mathematics. The summatory function of the Möbius function. The Möbius function is defined as the generating sequence for the reciprocal of the Riemann zeta function, that is,