We settle a conjecture of Farmer and Ki in a stronger form. Roughly speaking we show that there is a positive proportion of small gaps between consecutive zeros of the zeta-function $ζ(s)$ if and only if there is a positive proportion of zeros of $ζ'(s)$ lying very closely to the half-line. Our work has applications to the Siegel zero problem. We provide a criterion for the non-existence of the Siegel zero, solely in terms of the distribution of the zeros of $ζ(s)$. Finally on the Riemann Hypothesis and the Pair Correlation Conjecture we obtain near optimal bounds for the number of zeros of $ζ'(s)$ lying very closely to the half-line. Such bounds are relevant to a deeper understanding of Levinson's method, allowing us to place one-third of the zeros of the Riemann zeta-function on the half-line.
Assuming the Riemann Hypothesis we show that there exist infinitely many consecutive zeros of the Riemann zeta-function whose gaps are greater than 2.9 times the average spacing.
We study the value-distribution of Dirichlet polynomials on the critical line $\Re(s)=\tfrac{1}{2}$. As a consequence, we prove a corollary on small consecutive gaps between zeros of the Riemann zeta function. We also examine the distribution of zeros under the so-called alternative hypothesis and present a new approach to the problem of gaps between the zeros.
We prove that there exist infinitely many consecutive zeros of the Riemann zeta-function on the critical line whose gaps are greater than $3.18$ times the average spacing. Using a modification of our method, we also show that there are even larger gaps between the multiple zeros of the zeta function on the critical line (if such zeros exist).
Assuming the Riemann hypothesis, we investigate the distribution of gaps between the zeros of ξ'(s). We prove that a positive proportion of gaps are less than 0.796 times the average spacing and, in the other direction, a positive proportion of gaps are greater than 1.18 times the average spacing. We also exhibit the existence of infinitely many normalized gaps smaller (larger) than 0.7203 (1.5, respectively).
Combining the mollifiers, we exhibit other choices of coefficients that improve the results on large gaps between the zeros of the Riemann zeta-function. Precisely, assuming the Generalized Riemann Hypothesis (GRH), we show that there exist infinitely many consecutive gaps greater than 3.033 times the average spacing.
This text shows the existence of large (3.54 times the average) gaps between consecutive zeros, on the critical line, of some Dirichlet $L$-functions $L(s,χ),$ with $χ$ being an even primitive Dirichlet character.
Assuming the Generalized Riemann Hypothesis(GRH), we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at least 3.072 times the average spacing.
We show assuming RH that phenomena concerning pairs of zeros established $via$ pair correlations occur with positive density (with at most a slight adjustment of the constants). Also, while a double zero is commonly considered to be a close pair, we consider the difference between two $distinct$ zeros.
Let $K$ be a quadratic number field and $ζ_K(s)$ be the associated Dedekind zeta-function. We show that there are infinitely many normalized gaps between consecutive zeros of $ζ_K(s)$ on the critical line which are greater than $2.866$ times the average spacing.
Assuming the Riemann Hypothesis, we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at least 2.7327 times the average spacing and infinitely often they differ by at most 0.5154 times the average spacing.
Small values of $|ζ(1/2+it)|$ are investigated, using the value distribution results of A. Selberg. This gives an asymptotic formula for $μ(\{0 < t \le T : |ζ(1/2+it)| \le c\})$. Some related problems involving values of $|ζ(1/2+it)|$ and gaps between the consecutive ordinates of zeros of $ζ(s)$ are also discussed.
We show that the generalized Riemann hypothesis implies that there are infinitely many consecutive zeros of the Riemann zeta function whose spacing is 2.9125 times larger than the average spacing. This is deduced from the calculation of the second moment of the Riemann zeta function multiplied by a Dirichlet polynomial averaged over the zeros of the zeta function.
We make explicit an argument of Heath-Brown concerning large and small gaps between nontrivial zeroes of the Riemann zeta-function, $ζ(s)$. In particular, we provide the first unconditional results on gaps (large and small) which hold for a positive proportion of zeroes. To do this we prove explicit bounds on the second and fourth power moments of $S(t+h)-S(t)$, where $S(t)$ denotes the argument of $ζ(s)$ on the critical line and $h \ll 1 / \log T$. We also use these moments to prove explicit results on the density of the nontrivial zeroes of $ζ(s)$ of a given multiplicity.
In this paper, first by employing inequalities derived from the Opial inequality due to David Boyd with best constant, we will establish new unconditional lower bounds for the gaps between the zeros of the Riemann zeta function. Second, on the hypothesis that the moments of the Hardy Z-function and its derivatives are correctly predicted, we establish some explicit formulae for the lower bounds of the gaps between the zeros and use them to establish some new conditional bounds. In particular it is proved that the consecutive nontrivial zeros often differ by at least 6.1392 (conditionally) time…
We use the asymptotic large sieve, developed by the authors, to prove that if the Generalized Riemann Hypothesis is true, then there exist many Dirichlet L-functions that have a pair of consecutive zeros closer together than 0.37 times their average spacing. More generally, we investigate zero spacings within the family of twists by Dirichlet characters of a fixed L-function and give precise bounds for small gaps which depend only on the degree of the L-function.
Assuming the Riemann Hypothesis, we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at most 0.5155 times the average spacing and infinitely often they differ by at least 2.69 times the average spacing.
In this note, we prove Selberg's announced result on $r$-gaps between zeros of the Riemann zeta-function $ζ$. Our proof uses a result on variations of $\argζ$ by Tsang based on Selberg's method. The same result with explicit constants under the Riemann Hypothesis has been obtained by Conrey and Turnage-Butterbaugh using a different method. We explain how to obtain explicit constants under the Riemann Hypothesis using our approach which is based on Selberg's and Tsang's arguments.
Feng and Wu introduced a new general coefficient sequence into Montgomery and Odlyzko's method for exhibiting irregularity in the gaps between consecutive zeros of $ζ(s)$ assuming the Riemann Hypothesis. They used a special case of their sequence to improve upon earlier results on the gaps. In this paper we consider an equivalent form of the general sequence of Feng and Wu, and introduce a somewhat less general sequence $\{a_n\}$ for which we write the Montgomery-Odlyzko expressions explicitly. As an application, we give the following slight improvement of Feng and Wu's result: infinitely ofte…
We show that for any sufficiently large $T,$ there exists a subinterval of $[T,2T]$ of length at least $2.766 \times \frac{2π}{\log{T}},$ in which the function $t \mapsto ζ(1/2 + it)$ has no zeros.
Assume the Riemann Hypothesis, and let $γ^+>γ>0$ be ordinates of two consecutive zeros of $ζ(s)$. It is shown that if $γ^+-γ< v/ \log γ$ with $v<c$ for some absolute positive constant $c$, then the box $$ \{s=σ+it: 1/2<σ<1/2+v^2/4\logγ, γ\le t\le γ^+\} $$ contains exactly one zero of $ζ'(s)$. In particular, this allows us to prove half of a conjecture of Radziwiłł in a stronger form. Some related results on zeros of $ζ(s)$ and $ζ'(s)$ are also obtained.
It is proved that Epstein's zeta-function $ζ_{Q}(s)$, related to a positive definite integral binary quadratic form, has a zero $1/2 + iγ$ with $ T \leq γ\leq T + T^{{3/7} +\varepsilon} $ for sufficiently large positive numbers $T$. This is an improvement of the result by M. Jutila and K. Srinivas (Bull. London Math. Soc. 37 (2005) 45--53).
Assuming the Riemann Hypothesis, it is known that there are infinitely many consecutive pairs of zeros of the Riemann zeta-function within 0.515396 times the average spacing. This is obtained using the method of Montgomery and Odlyzko. We prove that this method can never find infinitely many pairs of consecutive zeros within 0.5042 times the average spacing.
Assuming the Riemann Hypothesis, we improve on previous results by proving there are infinitely many zeros of the Riemann zeta-function whose differences are smaller than 0.50412 times the average spacing. To obtain this result, we generalize a set of weights that were developed by Xiaosheng Wu, who used them to find a positive proportion of large and small gaps between zeros of the Riemann zeta-function.
In this paper, we prove the lower bound of the unconditional large gap is 3.5555 which improves the obtained value 3.079 in the literature. Next, on the hypothesis that the moments of the Hardy Z-function and its derivatives are correctly predicted we establish a new explicit formula of the gaps and use it to establish some lower bounds for k=3,4,...,15. In particular it is proved that lower bound when k=15 is 9.6435 which means that the consecutive nontrivial zeros often differ by at least 9.6435 times the average spacing. The main results are proved by employed an integral inequality with a …
Suppose $E$ is an elliptic curve over $\mathbb{Q}$ of conductor $N$ with complex multiplication (CM) by $\mathbb{Q}(i)$, and $f_E$ is the corresponding cuspidal Hecke eigenform in $S^{\mathrm{new}}_2(Γ_0(N))$. Then $n$-th Fourier coefficient of $f_E$ is non-zero in the short interval $(X, X + cX^{\frac{1}{4}})$ for all $X \gg 0$ and for some $c > 0$. As a consequence, we produce infinitely many cuspidal CM eigenforms $f$ level $N>1$ and weight $k > 2$ for which $i_f(n) \ll n^{\frac{1}{4}}$ holds, for all $n \gg 0$.
Under the Riemann Hypothesis, we prove for any natural number $r$ there exist infinitely many large natural numbers $n$ such that $(γ_{n+r}-γ_n)/(2π/\log γ_n) > r + Θ\sqrt{r}$ and $(γ_{n+r}-γ_n)/(2π/\log γ_n) < r - \vartheta\sqrt{r}$ for explicit absolute positive constants $Θ$ and $\vartheta$, where $γ$ denotes an ordinate of a zero of the Riemann zeta-function on the critical line. Selberg published announcements of this result several times but did not include a proof. We also suggest a general framework which might lead to stronger statements concerning the vertical distribution of nontriv…
We show that if a modular cuspidal eigenform $f$ of weight $2k$ is $2$-adically close to an elliptic curve $E/\mathbb{Q}$, which has a cyclic rational $4$-isogeny, then $n$-th Fourier coefficient of $f$ is non-zero in the short interval $(X, X + cX^{\frac{1}{4}})$ for all $X \gg 0$ and for some $c > 0$. We use this fact to produce non-CM cuspidal eigenforms $f$ of level $N>1$ and weight $k > 2$ such that $i_f(n) \ll n^{\frac{1}{4}}$ for all $n \gg 0$.
Let $L(s,f)$ be an $L$-function associated to a primitive (holomorphic or Maass) cusp form $f$ on GL(2) over $\mathbb{Q}$. Combining mean-value estimates of Montgomery and Vaughan with a method of Ramachandra, we prove a formula for the mixed second moments of derivatives of $L(1/2+it,f)$ and, via a method of Hall, use it to show that there are infinitely many gaps between consecutive zeros of $L(s,f)$ along the critical line that are at least $\sqrt 3 = 1.732...$ times the average spacing. Using general pair correlation results due to Murty and Perelli in conjunction with a technique of Montg…
In 1931, Van der Corput showed that if for each positive integer $s$, the sequence $\{x_{n+s}-x_n\}$ is uniformly distributed (mod 1), then the sequence $x_n$ is uniformly distributed (mod 1). The converse of above result is surprisingly not true. The distribution of consecutive gaps of an equidistributed sequence has been studied widely in the literature. In this paper, we have studied the distribution of gaps between one or more equidistributed sequences. Under certain conditions, we could study the distribution effectively. As applications, we study the equidistribution of gaps between eige…
We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be applied to this question.
Assuming that there exist (infinitely many) Siegel zeros, we show that the (Rosser-)Jurkat-Richert bounds in the linear sieve cannot be improved, and similarly look at Iwaniec's lower bound on Jacobsthal's problem, as well as minor improvements to the Brun-Titchmarsh Theorem. We also deduce an improved (though conditional) lower bound on the longest gaps between primes, and rework Cramér's heuristic in this situation to show that we would expect gaps around $x$ that are significantly larger than $(\log x)^2$.
It is commonly believed that the normalized gaps between consecutive ordinates $t_n$ of the zeros of the Riemann zeta function on the critical line can be arbitrarily large. In particular, drawing on analogies with random matrix theory, it has been conjectured that $$λ' ={ lim ~ sup} ~( t_{n+1} - t_n ) \frac{ \log( t_n /2 πe)}{2π}$$ equals $\infty$. In this article we provide arguments, although not a rigorous proof, that $λ'$ is finite. Conditional on the Riemann Hypothesis, we show that if there are no changes of branch between consecutive zeros then $λ' \leq 3$, otherwise $λ'$ is allowed to…
In the paper, I consider appearance of unit's digits in minor totals of a few integer sequences. The sequences include the sequence of even integers, sequence of odd integers and Faulhaber polynomial at $p = 2$. Application of difference tables allows predicting of which digits can appear as unit's digits in minor totals of the sequences. Absence of some digits ("gaps" in frequency distributions) depends often on numbering system applied. However, in case of odd numbers' integers the gaps are found under all numbering systems with bases from 3 to 10.
The well known Three Gap Theorem states that there are at most three gap sizes in the sequence of fractional parts $\{αn\}_{n<N}$ . It is known that if one averages over α, the distribution becomes continuous. We present an alternative approach, which establishes this averaged result and also provides good bounds for the error terms.
Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<φ(q)\log^2x$. More precisely, the vast majority of maximal gaps are near a trend curve $T$ predicted using a generalization of Wolf's conjecture: $$G_{q,r}(x) ~\sim~ T(q,x)={φ(q)x\over{\rm li}(x)} \Big(2\log{{\rm li}(x)\overφ(q)} - \log x + b\Big),$$ where $b = b(q,x) = O_q(1)$. The distribution of properly rescaled maximal gaps $G_{q,r}(x)$ is close to the Gumbel extreme value distribution.…
In this paper, we will employ the Opial and Wirtinger type inequalities to derive some conditional and unconditional lower bounds for the gaps between the zeros of the Riemann zeta-function. First, we prove (unconditionally) that the consecutive nontrivial zeros often differ by at least 1.9902 times the average spacing. This value improves the value 1.9 due to Mueller and the value 1.9799 due to Montogomery and Odlyzko. Second, on the hypothesis that the 2k-th mixed moments of the Hardy Z-function and its derivative are correctly predicted by random matrix theory, we derive some explicit formu…
Let $L(s, π\timesπ^\prime)$ be the Rankin--Selberg $L$-function attached to automorphic representations $π$ and $π^\prime$. Let $\tildeπ$ and $\tildeπ^\prime$ denote the contragredient representations associated to $π$ and $π^\prime$. Under the assumption of certain upper bounds for coefficients of the logarithmic derivatives of $L(s, π\times\tildeπ)$ and $L(s, π^\prime\times\tildeπ^\prime)$, we prove a log-free zero-density estimate for $L(s, π\timesπ^\prime)$ which generalises a result due to Fogels in the context of Dirichlet $L$-functions. We then employ this log-free estimate in studying …
In the framework of Cramer's probabilistic model of primes, we explore the exact and asymptotic distributions of maximal prime gaps. We show that the Gumbel extreme value distribution exp(-exp(-x)) is the limit law for maximal gaps between Cramer's random primes. The result can be derived from a general theorem about intervals between discrete random events occurring with slowly varying probability monotonically decreasing to zero. A straightforward generalization extends the Gumbel limit law to maximal gaps between prime constellations in Cramer's model.
We study the first occurrences of gaps between primes in the arithmetic progression (P): $r$, $r+q$, $r+2q$, $r+3q,\ldots,$ where $q$ and $r$ are coprime integers, $q>r\ge1$. The growth trend and distribution of the first-occurrence gap sizes are similar to those of maximal gaps between primes in (P). The histograms of first-occurrence gap sizes, after appropriate rescaling, are well approximated by the Gumbel extreme value distribution. Computations suggest that first-occurrence gaps are much more numerous than maximal gaps: there are $O(\log^2 x)$ first-occurrence gaps between primes in (P) …
We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level spacing statistics for quantum graphs. The key ingredient is Weyl equidistribution of irrational translations on multi-dimensional tori. Our results extend to logarithms with arbitrary base; we deduce explicit formulas when the base is transcendental or the r:th root of an integer. If the base is close to one, the gap distribution is close to the exponential…
In this paper, we apply the method of Maynard and Tao to the set of products of two distinct primes (E2-numbers). We obtain several results on the distribution of E2-numbers and primes. Among others, the result of Goldston, Pintz, Yildirim and Graham on small gaps between m consecutive E2-numbers is improved.
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ős conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the nonnegative part of the real line. He and independently G. Ricci proved in 1954-55 that the set J of limit points of the sequence {d_n/logn} has positive Lebesgue measure. The first and until now only concrete known element of J was proved to be the number zero in the work of Goldston, Yildirim and the present author. The author of the present note showed in 2013 …
In this paper we study the distribution of the non-trivial zeros of the Riemann zeta-function $ζ(s)$ (and other L-functions) using Montgomery's pair correlation approach. We use semidefinite programming to improve upon numerous asymptotic bounds in the theory of $ζ(s)$, including the proportion of distinct zeros, counts of small gaps between zeros, and sums involving multiplicities of zeros.
Let p_n denote the sequence of all primes and let d_n=p_n-p_{n-1} denote the sequence of all gaps between consecutive primes. In 1948 Erdős and Turán showed that d_{n+1}-d_n changes sign infinitely often and together with Pólya asked for a necessary and sufficient condition that a fixed linear combination of r>1 consecutive prime gaps d_{n+i} i=(1,2,...r) should change sign infinitely often as n runs through the sequence of all natural numbers. They conjectured that the condition is that the non zero values among the coefficients of the linear combination cannot all have the same sign but they…
Zeckendorf proved that any integer can be decomposed uniquely as a sum of non-adjacent Fibonacci numbers, $F_n$. Using continued fractions, Lekkerkerker proved the average number of summands of an $m \in [F_n, F_{n+1})$ is essentially $n/(φ^2 +1)$, with $φ$ the golden ratio. Miller-Wang generalized this by adopting a combinatorial perspective, proving that for any positive linear recurrence the number of summands in decompositions for integers in $[G_n, G_{n+1})$ converges to a Gaussian distribution. We prove the probability of a gap larger than the recurrence length converges to decaying geom…
Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator a(log(x/a)-b) satisfactorily predicts the maximal gaps below x, where a is the expected average gap between the same type of k-tuples, a=O(log^k x). Heuristics suggest that maximal gaps between prime k-tuples near x are approximately a*log(x/a), and thus have the order O(log^{k+1}x). The distribution of maximal gaps around the trend curve a*log(x/a) is close …
Erdös conjectured that the set J of limit points of d_n/logn contains all nonnegative numbers, where d_n denotes the nth primegap. The author proved a year ago (arXiv: 1305.6289) that J contains an interval of type [0,c] with a positive ineffective value c. In the present work we extend this result for a large class of normalizing functions. The only essential requirement is that the function f(n) replacing logn should satisfy f(n)<<lognloglognloglogloglogn/(logloglogn)^2 (with a small implied constant), the well-known Erdös-Rankin bound for the largest known gaps between consecutive primes. T…
