Primes in explicit short intervals on RH

  title={Primes in explicit short intervals on RH},
  author={Adrian W. Dudek and Loic Greni'e and Giuseppe Molteni},
  journal={arXiv: Number Theory},
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers. 
Explicit short intervals for primes in arithmetic progressions on GRH
We prove explicit versions of Cramér’s theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.
Primes and prime ideals in short intervals
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
Fourier optimization and prime gaps
We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between
Primes in arithmetic progressions and semidefinite programming
The Guinand-Weil explicit formula over all Dirichlet characters modulo $q \geq 3$ is extended and the associated extremal problems are reduced to convex optimization problems that can be solved numerically via semidefinite programming.
Effective estimates for some functions defined over primes
. In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number x 0 so that some inequality involving Chebyshev’s ϑ
Variants on Andrica's conjecture assuming the Riemann hypothesis
It is (reasonably) well-known that the Riemann hypothesis is not sufficient to prove Andrica's conjecture: $\forall n\geq 1$, is $\sqrt{p_{n+1}}-\sqrt{p_n} \leq 1$? But can one at least get tolerably
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard
It is proved that the two-item joint replenishment problem with possibly empty joint ordering points is NP-complete under randomized reductions, which implies that not even quantum computers may be able to solve it efficiently.


On the Riemann hypothesis and the difference between primes
We prove some results concerning the distribution of primes assuming the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x}...
The distribution of prime numbers
Preface Introduction 1. Elementary theorems 2. The prime number theorem 3. Further theory of ( ). applications 4. Explicit formulae 5. Irregularities of distribution Bibliography.
Primes between consecutive squares
Abstract. A well known conjecture about the distribution of primes asserts that between two consecutive squares there is always at least one prime number. The proof of this conjecture is quite out of
Sharper bounds for the Chebyshev functions $\theta (x)$ and $\psi (x)$
Abstract : The authors demonstrate a wider zero-free region for the Riemann zeta function than has been given before. They give improved methods for using this and a recent determination that
On the first sign change of θ(x) - x
It is shown that θ(x) < x for 2 < x < 1.39 ·10 and there is an x < exp(727.951332668) for which θ (x) > x.
Abstract. We study an extension of Montgomery’s pair-correlation conjecture and its rele-vance in some problems on the distribution of prime numbers.Keywords. Riemann zeta function, pair correlation
Explicit smoothed prime ideals theorems under GRH
An efficient algorithm for the computation of the residue of the Dedekind zeta function and a bound on small-norm prime ideals is deduced.
Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅1018
How the even Goldbach conjecture was confirmed to be true for all even numbers not larger than 4 · 1018 and how the counts of minimal Goldbach partitions and of prime gaps are in excellent accord with the predictions made using the prime k-tuple conjecture of Hardy and Littlewood are described.
The new book of prime number records
1 How Many Prime Numbers Are There?.- I. Euclid's Proof.- II. Goldbach Did It Too!.- III. Euler's Proof.- IV. Thue's Proof.- V. Three Forgotten Proofs.- A. Perott's Proof.- B. Auric's Proof.- C.