Related papers: Primes in short intervals

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in…

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Let $p$ be a prime number, $C$ be any absolutely irreducible affine plane curve over $\mathbb{F}_p$, and $g,f\in\mathbb{F}_p(x,y)$ be rational functions. We continue the study of the distribution of the values of short hybrid exponential…

We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

Let $\{X_n,n\ge1\}$ be a sequence of independent and identically distributed random variables, taking non-negative integer values, and call $X_n$ a $\delta$-record if $X_n>\max\{X_1,...,X_{n-1}\}+\delta$, where $\delta$ is an integer…

In this paper, we study the counting functions $\psi_\mathcal{P}(x)$, $N_\mathcal{P}(x)$ and $M_\mathcal{P}(x)$ of a generalized prime system $\mathcal{N}$. Here $M_\mathcal{P}(x)$ is the partial sum of the M\"{o}bius function over…

For $k\geq 1$ an integer and $x\geq 1$ a real number, let $\pi_k(x)$ be the number of integers smaller than $x$ having exactly $k$ distinct prime divisors. Building on recent work of Matom\"aki and Radziwi\l\l, we investigate the asymptotic…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

A great deal of inference in statistics is based on making the approximation that a statistic is normally distributed. The error in doing so is generally $O(n^{-1/2})$ and can be very considerable when the distribution is heavily biased or…

The extreme statistics of time signals is studied when the maximum is measured from the initial value. In the case of independent, identically distributed (iid) variables, we classify the limiting distribution of the maximum according to…

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

Hierarchical modeling is wonderful and here to stay, but hyperparameter priors are often chosen in a casual fashion. Unfortunately, as the number of hyperparameters grows, the effects of casual choices can multiply, leading to considerably…

With $\xi$ the number of triangles in the usual (Erd\H{o}s-R\'enyi) random graph $G(m,p)$, $p>1/m$ and $\eta>0$, we show (for some $C_{\eta}>0$) $$\Pr(\xi> (1+\eta)\E \xi) < \exp[-C_{\eta}\min{m^2p^2\log(1/p),m^3p^3}].$$ This is tight up to…