Related papers: Explicit relations between primes in short interva…

We prove asymptotics for the average error term in Bateman-Horn's conjecture in the exponential range.

We discuss the relationship between ratio asymptotics for general orthogonal polynomials and the asymptotics of the associated Bergman shift operator. More specifically, we consider the case in which a measure is supported on an infinite…

Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) =…

For two arithmetical functions $f$ and $g$ with absolutely convergent Ramanujan expansions, Murty and Saha have recently derived asymptotic formulas with error term for the convolution sum $\sum_{n \le N} f(n) g(n+h)$ under some suitable…

In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.

Asymptotic approximations ($n \to \infty$) to the truncation errors $r_n = - \sum_{\nu=0}^{\infty} a_{\nu}$ of infinite series $\sum_{\nu=0}^{\infty} a_{\nu}$ for special functions are constructed by solving a system of linear equations.…

Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.

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…

Assuming the Riemann Hypothesis (RH), Montgomery proved a theorem in 1973 concerning the pair correlation of zeros of the Riemann zeta-function and applied this to prove that at least $2/3$ of the zeros are simple. In this paper, we…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

The Riemann hypothesis (RH) is a long-standing open problem in mathematics. It conjectures that non-trivial zeros of the zeta function all have real part equal to 1/2. The extent of the consequences of RH is far-reaching and touches a wide…

Taking $r>0$, let $\pi_{2r}(x)$ denote the number of prime pairs $(p, p+2r)$ with $p\le x$. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that $\pi_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$.…

We compute the average of a product of two shifted squares of the Riemann zeta on the critical line with shifts up to size $T^{3/2-\varepsilon}$. We give an explicit expression for such an average and derive an approximate spectral…

In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable…

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…

The precise one-shot characterisation of operational tasks in classical and quantum information theory relies on different forms of smooth entropic quantities. A particularly important connection is between the hypothesis testing relative…

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…

We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…

The extended Riemann hypothesis (ERH) for Dedekind zeta functions remains one of the most elusive open problems in number theory. Over the last century, many equivalent statements to the classical Riemann hypothesis alone have been…

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.