Related papers: On the singular series in the prime k-tuple conjec…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…

If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify…

This paper is a part of our programme to generalise the Hardy-Littlewood method to handle systems of linear questions in primes. This programme is laid out in our paper Linear Equations in Primes [LEP], which accompanies this submission. In…

Let $\mathcal{H}^{*}=\{h_1,h_2,\ldots\}$ be an ordered set of integers. We give sufficient conditions for the existence of increasing sequences of natural numbers $a_j$ and $n_k$ such that $n_k+h_{a_j}$ is a sum of two squares for every…

We prove a uniform estimate for sums of Hecke--Maass eigenvalues squared over primes in short intervals that can be regarded as an analogue of Hoheisel's classical prime number theorem for all real analytic cusp forms. Our argument is…

Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…

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…

We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of prime pairs to the $L^{1}$ norm of an exponential sum over the primes formed with the von Mangoldt function.

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

Let $D_{k}$ be a set with $k$ distinct elements of integers such that $d_{1}<d_{2}<\cdots<d_{k}$. We say $D_{k}^{*}$ is a $k$-tuple prime difference champion ($k$-tuple PDC) for primes $\le x$ if the set $D_{k}^{*}$ is the most probable…

The main purpose of this article is to survey on some key elements of a recent $\mathcal{H}_p$-theory of general Dirichlet series $\sum a_n e^{-\lambda_{n}s}$, which was mainly inspired by the work of Bayart and Helson on ordinary Dirichlet…

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…

In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula involves a new class of generalized Littlewood-Richardson coefficients, all of which surprisingly seem to be…

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…