# D. A. Goldston

## Publications Authored By D. A. Goldston

In this paper, we obtain bounds on the $L^1$ norm of the sum $\sum_{n\le x}\tau(n) e(\alpha n)$ where $\tau(n)$ is the divisor function. Read More

A Prime Difference Champion (PDC) for primes up to $x$ is defined to be any element of the set of one or more differences that occur most frequently among all positive differences between primes $\le x$. Assuming an appropriate form of the Hardy-Littlewood Prime Pair Conjecture we can prove that for sufficiently large $x$ the PDCs run through the primorials. Numerical results also provide evidence for this conjecture as well as other interesting phenomena associated with prime differences. Read More

Assuming the Riemann Hypothesis, we obtain asymptotic formulas for the average number representations of an even integer as the sum of two primes. We use the method of Bhowmik and Schlage-Puchta and refine their results slightly to obtain a more recent result of Languasco and Zaccagnini, and a new result on a smoother average. Read More

We obtain an asymptotic formula for a weighted sum of the square of the tail of the singular series for the Goldbach and prime-pair problems. Read More

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect of a theorem of Gallagher that the prime $k$-tuple conjecture implies that the prime numbers are distributed in a Poisson distribution around their average spacing. Read More

We show that a positive proportion of all gaps between consecutive primes are small gaps. We provide several quantitative results, some unconditional and some conditional, in this flavour. Read More

We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes. Read More

**Category:**Mathematics - Number Theory

An integer $d$ is called a jumping champion for a given $x$ if $d$ is the most common gap between consecutive primes up to $x$. Occasionally several gaps are equally common. Hence, there can be more than one jumping champion for the same $x$. Read More

The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. Read More

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of exactly two primes. Read More

**Category:**Mathematics - Number Theory

We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken on by the differences between primes. Read More

This paper is based on a talk given to motivated high school (and younger) students at a BAMA (Bay Area Math Adventure) event. Some of the methods used to study primes and twin primes are introduced. Read More

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place of 6. Read More

This paper describes some of the ideas used in the development of our work on small gaps between primes. Read More

Let $\pi S(t)$ denote the argument of the Riemann zeta-function at the point $\frac12+it$. Assuming the Riemann Hypothesis, we sharpen the constant in the best currently known bounds for $S(t)$ and for the change of $S(t)$ in intervals. We then deduce estimates for the largest multiplicity of a zero of the zeta-function and for the largest gap between the zeros. Read More

**Category:**Mathematics - Number Theory

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 Elliott-Halberstam conjecture, we prove that there are infinitely often primes differing by 16 or less. Read More

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. Read More

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially self-contained, we shall develop a simplified account of the method used in [3]. While [3] also includes quantitative versions of $(0)$, we are concerned here solely with proving the qualitative $(0)$, which still exhibits all the essentials of the method. Read More

**Category:**Mathematics - Number Theory

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 a positive proportion of consecutive primes are within a quarter of the average spacing between primes. Read More

We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also calculate the mixed (with a factor of $\Lambda(n)$) correlations. Read More

These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory necessary to understand Montgomery's work on the pair correlation of the zeros of the Riemann zeta-function and subsequent work on how this relates to prime numbers. A very brief introduction to Selberg's work on the moments of $S(T)$ is also given. Read More

We obtain the general k-correlations for a short divisor sum related to primes. Read More

We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some applications to primes in short intervals. Read More

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results were averaged over all progression of a given modulus. The method uses a short divisor sum approximation for the von Mangoldt function, together with some new results for binary correlations of this divisor sum approximation in arithmetic progressions. Read More