Related papers: Correlations between primes in short intervals on …

Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on…

Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

Under the assumption of the Riemann Hypothesis (RH), we prove explicit quantitative relations between hypothetical error terms in the asymptotic formulae for truncated mean-square average of exponential sums over primes and in the…

Littlewood's theorem is one of the pioneering results in random analytic functions over the open unit disk. In this paper, we prove some analogues of this theorem for Hardy spaces in infinitely many variables. Our results not only cover…

The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…

Differentially algebraic Hardy field extensions of short Hardy fields are short. This is proved in the more general setting of $H$-fields. As an application we extend a theorem of Rosenlicht (1981) by showing that each short asymptotic…

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

In 2021, Daqing Wan and Ping Xi studied the equivalence of the Lang-Trotter conjecture for CM elliptic curves and the Hardy-Littlewood conjecture for primes represented by a quadratic polynomial. Wan and Xi provided an alternative…

Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…

The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…

Assuming the Riemann hypothesis (RH) and the linear independence conjecture (LI), we show that the weighted count of primes in multiple short intervals follows a multivariate Gaussian distribution with weak negative correlations. As an…

The Piatetski-Shapiro sequences are of the form ${\mathcal{N}}^{(c)} := (\lfloor n^c \rfloor)_{n=1}^\infty$ with $c > 1, c \not\in \mathbb{N}$. In this paper, we study the distribution of pairs $(p, p^{\#})$ of consecutive primes such that…

In the present paper we investigate distributional properties of sparse sequences modulo almost all prime numbers. We obtain new results for a wide class of sparse sequences which in particular find applications on additive problems and the…

We use a function field version of the Hardy-Littlewood circle method to study the locus of free rational curves on an arbitrary smooth projective hypersurface of sufficiently low degree. On the one hand this allows us to bound the…

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

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…

The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of…

Goldston and Montgomery [3] proved that the Strong Pair Correlation Conjecture and two second moments of primes in short intervals are equivalent to each other under Riemann Hypothesis. In this paper, we get the second main terms for each…

In 1976, Gallagher showed that the Hardy--Littlewood conjectures on prime $k$-tuples imply that the distribution of primes in log-size intervals is Poissonian. He did so by computing average values of the singular series constants over…