Consecutive moderate gaps between zeros of the Riemann zeta function
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Consecutive moderate gaps between zeros of the Riemann zeta function".
Emmy: Here's the gist of the paper. Consecutive moderate gaps between zeros of the Riemann zeta function investigates whether there exist infinitely often sequences of consecutive gaps between consecutive ordinates of nontrivial zeros that are all "moderate," defined as being greater than or equal to a certain threshold related to the average gap size <ref:2412.15481#pg3>.
Ada: Defining Moderate Gaps The paper introduces the concept of a "moderate gap" between consecutive ordinates of zeros, which is defined as a gap where γn+1 −γn ≥ 2πc/ log T for some fixed positive constant c <ref:2412.15481#pg3>.
Emmy: This observation is classical and has been used to show that one can choose a sequence of heights T → ∞ between two consecutive ordinates γn.
Ada: The central question is how frequently there are r + 1 consecutive ordinates (γn, γn+1,..., γn+r) such that the r consecutive gaps between them are all greater than or equal to 2πc/ log T for some fixed positive c <ref:2412.15481#pg3>.
Title and authors: Ada: So we're looking at the paper "Consecutive moderate gaps between zeros of the Riemann zeta function" by Steven Gonek and Anurag Sahay. The main idea here is investigating whether there are infinitely often sequences where you find r consecutive gaps between these ordinates that are all considered "moderate".
Emmy: Moderate gaps, right? The paper defines this as a gap between two consecutive zeros, gamma n + one and gamma n, being greater than or equal to two pi c divided by the logarithm of T, for some fixed positive constant c, as the height T gets large <ref:2412.15481#pg1>.
Kolya: So it's about these consecutive moderate gaps, and whether they happen often enough in a sequence of length three, four, or whatever. It sounds like we're checking if these relatively large gaps are persistent over multiple steps between the zeros.
Ada: Exactly. The core question is how frequently we can find r consecutive ordinates such that all the gaps between them meet that threshold of two pi c divided by the logarithm of T <ref:2412.15481#pg1>. It's about persistence across several steps, not just a single large gap.
Emmy: The paper explores this by looking at different assumptions about the zeros. It sets up a few hypotheses to see what kind of results we get in each case, and that’s where the structure of the argument really becomes interesting to me.
Kolya: I'm curious about those hypotheses because they lead to very different conclusions. One path assumes Riemann Hypothesis, plus something called the Alternative Hypothesis and that all zeros are simple.
Ada: That first hypothesis leads to a result where, as T goes to infinity, the probability of finding zeros in a certain region drops off faster than one-to-one.
Emmy: And what that implies is that for any fixed length r, you can find (r + one) -tuples of ordinates where every single gap between them is greater than or equal to pi divided by two minus some tiny amount, all relative to the logarithm of T <ref:2412.15481#pg1>.
Kolya: That sounds quite strong because it's suggesting that these long stretches of moderate gaps happen infinitely often under those specific conditions. But what about the other hypotheses?
Title and authors: Ada: Well, there’s the GUE Hypothesis, which relates the zeros' correlations to random matrices from the Gaussian unitary ensemble. Under that assumption, computing a quantity labeled four shows that for any positive c, you find a positive proportion of zeros have r consecutive moderate gaps of size greater than or equal to two pi c divided by the logarithm of T <ref:2412.15481#pg1>.
Emmy: That connects the number theory structure to the random matrix world. It suggests that the statistical behavior of these gaps is similar to what we see in those ensembles.
Kolya: From a probabilistic standpoint, if you can prove that a positive proportion exists under GUE, that's a solid result for our understanding of zero spacing statistics. But does it hold up when we only assume the Pair Correlation Conjecture?
Ada: The Pair Correlation Conjecture, combined with Riemann Hypothesis and Theorem two point one in this paper, shows something different: for any fixed length r and any positive c, there are numbers c for which a positive proportion of zeros give you those consecutive gaps <ref:2412.15481#pg1>.
Emmy: So we have three major avenues here: the Alternative Hypothesis scenario, the GUE scenario, and what results come from assuming the Pair Correlation Conjecture alongside Riemann Hypothesis. It's a lot to keep track of.
Kolya: I'm thinking about how unconditional this is. Is there anything that holds true even if we don't assume any of those big conjectures?
Ada: Yes, the paper has an unconditional result in Section three showing that even if every gap larger than two pi c divided by the logarithm of T is followed by a smaller gap, there are still sets of ordinates where certain interval constraints on zero counts are met <ref:2412.15481#pg2>.
Emmy: That unconditional result, Theorem three point one, seems to give us some concrete structure even without relying on those very strong conjectures about the zeros being distributed like random matrices <ref:2412.15481#pg2>.
Kolya: That sounds like a useful piece of information for bounding things up in practice, even if it doesn't prove the strongest conditional results we discussed earlier. What does that mean for the actual distribution of gaps?
Ada: It means that you can still find sets T of measure greater than one minus epsilon times T where every interval in a sequence of r intervals contains at least one consecutive pair with a gap length greater than or equal to four pi divided by three divided by the logarithm of T.
Title and authors: Emmy: That gives us a way to bound certain quantities on the critical line, which is what they apply this to later in their work. It moves us from just counting gaps to actually controlling how much information you can get from those regions.
Kolya: So we've seen that under specific high-level assumptions, we get positive proportions of zeros exhibiting these long consecutive moderate gaps. The unconditional result gives us a baseline existence for these structures in certain sets of points.
Ada: And then there’s the application part, which is where they look at bounds on derivatives like xi double prime over xi prime on specific contours in the critical strip. This uses Theorem four point one to show that under these conditions, that derivative stays bounded by something related to the logarithm of T <ref:2412.15481#pg3>.
Emmy: So, it's not just about counting gaps; they are using this gap information to constrain how much information we can extract from the zeta function itself on those contours. That connects the spacing problem directly to analytic number theory applications.
Kolya: The paper is really showing that these moderate gaps aren't just isolated events; they have a structure that persists, whether you assume the Riemann Hypothesis, GUE behavior, or just look at unconditional bounds. It’s about finding regularity in what we expect to be very random.
Ada: So to wrap up the main points of "Consecutive moderate gaps between zeros of the Riemann zeta function," we see positive proportions of zeros exhibiting r consecutive moderate gaps when assuming the Alternative Hypothesis, GUE Hypothesis, or the Pair Correlation Conjecture.
Emmy: Unconditionally, there are still sets where interval constraints on zero counts hold for a sequence of intervals that have at least one pair with a gap larger than four pi divided by three divided by the logarithm of T.
Kolya: And they use this to establish bounds on derivatives like xi double prime over xi prime on certain segments in the critical strip.
Ada: So, it’s a deep look into the structure of zero spacing, showing how these moderate gaps behave under various strong conditions, and proving that even without those conditions, some structural persistence remains. That's where we wrap up today with this paper.
The paper's summary: Ada: So, to get back to where we are on these zero gaps, this paper essentially investigates whether you can find long stretches of consecutive zeros that all have those moderate gaps between them.
Emmy: That’s right, it’s about finding sequences of r consecutive ordinates where every gap between them is bigger than some threshold related to the logarithm of T.
Kolya: The paper lays out a few different ways you can approach this question based on what we already assume about the zeros.
Ada: Exactly, they test several big hypotheses. First, there’s this Alternative Hypothesis scenario where if certain conditions hold true for the Riemann zeta function, then as T gets really large, the probability of finding zeros in a small region drops off quickly.
Emmy: And what that drop-off means is that you can find these long stretches of moderate gaps infinitely often under those specific assumptions.
Kolya: Then they look at the GUE Hypothesis, which connects the spacing of these zeros to random matrices from the Gaussian unitary ensemble. Under that assumption, they use tools to show a positive proportion of zeros must have r consecutive moderate gaps for any fixed size you pick.
Ada: And then there’s what they call the Pair Correlation Conjecture, which is another way we guess the zeros are distributed statistically like random eigenvalues. If you assume that along with the Riemann Hypothesis, they find that a positive proportion of zeros exhibit those long consecutive gaps.
Emmy: The interesting part is when they move away from those strong assumptions and look at what happens unconditionally.
Kolya: They have an unconditional result showing that even if every gap larger than some threshold is followed by a smaller one, you can still find sets of ordinates where the count of zeros in a sequence of intervals meets certain requirements.
Ada: That’s Theorem three point one, and it means that even without assuming those big conjectures, there's still this structural persistence in how the zeros are spread out in certain regions.
Emmy: And they use that finding to make some bounds on derivatives of the zeta function on specific lines in the critical strip.
Kolya: So what this all boils down to is showing that these moderate gaps aren't just random noise; there’s a structure to them, whether you assume the most optimistic hypotheses or just stick to what we can prove without those assumptions.
Ada: And they apply it by bounding things like xi double prime over xi prime on certain segments of the critical line.
Emmy: It connects this gap analysis directly to controlling how much information you can get from the zeta function itself when you look at those specific contours.
Kolya: We’ve seen that under different assumptions, we get positive proportions of zeros with these consecutive moderate gaps, and unconditionally, we find sets where certain interval constraints on zero counts are met.
Ada: And then they use that to establish bounds on derivatives like xi double prime over xi prime on specific segments in the critical strip.
Emmy: This shows that the structure of these gaps has real implications for controlling how much information you can extract from the zeta function itself.
Kolya: It’s a deep look into zero spacing, showing that these moderate gaps behave consistently under various conditions, and proving some structural persistence even without those strong assumptions.
The paper's improvements: Kolya: So, we’ve talked about what the paper found under different assumptions—the conditional results versus what’s unconditional—and now we're looking at how they suggest improving that work.
Ada: The authors are proposing ways to tighten those bounds, you know, making the thresholds a little bit more precise.
Emmy: They are suggesting that instead of just having some fixed constant c, you can use something adaptive based on T itself.
Kolya: So what does that mean for the numbers? Does it help us get closer to an exact count or a tighter estimate on those gaps?
Ada: It’s about making the gap analysis more dynamic, so the system can actually determine if a gap is moderate based on a threshold that changes as T gets larger.
Emmy: That sounds like moving from a fixed ruler to something that adjusts its measurement based on where you are in the sequence.
Kolya: And this adaptive approach seems useful because it’s directly tied to how fast the zeros spread out, which is what we really care about for applications.
Ada: Exactly, it’s an improvement in the Adaptive Gap Analysis for Zero Statistics Systems, so it can figure out if consecutive gaps are moderate using a threshold that scales with T.
Emmy: It brings us closer to understanding the true local behavior of those zero spacings, not just some average global picture.
Kolya: If we can get better at detecting these gaps based on their size relative to T, it means we get better control over the tail of the distribution.
Ada: That leads into Hypothesis Testing Under Alternative Hypotheses, where they use this adaptive idea to calculate something called p zero of T.
Emmy: They are testing those alternative hypotheses by seeing how this adaptive threshold impacts their estimates for how often certain gap patterns occur.
Kolya: It’s about getting better at inferring bounds on consecutive gap sizes from the behavior of p zero of T, which is a really useful probabilistic tool.
Ada: And they also have this GUE Correlation Prediction Engine idea, where they use Fredholm determinants to predict how often those r consecutive moderate gaps appear.
Emmy: That’s using the structure of random matrices to predict the frequency of these patterns in the zeta zeros. It’s a big connection there.
Kolya: And finally, there’s this Pair Correlation Conjecture Verification Module, which checks if those r-tuples have lengths greater than two pi c divided by log T using that adaptive logic.
Ada: So the overall idea is that these improvements help us refine the tools we use to detect and quantify these structures.
Emmy: It turns a static question about gaps into a dynamic system that responds to the height T.
Kolya: And this refinement, this better detection, is what allows them to move toward more precise bounds on things like xi double prime over xi prime on those critical strip segments we talked about earlier.
Ada: Right, so these refinements are what make the application part of the paper much more robust and usable.
Conclusion: Ada: So, to wrap up on this paper "Consecutive moderate gaps between zeros of the Riemann zeta function," we see that we can find positive proportions of zeros exhibiting r consecutive moderate gaps when assuming the Alternative Hypothesis, GUE Hypothesis, or the Pair Correlation Conjecture.
Emmy: Unconditionally, they also showed sets where interval constraints on zero counts hold for a sequence of intervals that have at least one pair with a gap larger than four pi divided by three divided by the logarithm of T.
Kolya: I think it’s important to remember that these conditional results are very strong, but the unconditional part gives us some solid ground even without those big assumptions.
Ada: True, it means we have a baseline for what we can expect in terms of zero spacing persistence.
Emmy: And they use this structural information to establish bounds on derivatives like xi double prime over xi prime on certain segments in the critical strip.
Kolya: That application part is what really shows how these gap statistics translate into something useful for analytic number theory, which is what we wanted to see from this line of research.
Ada: So, this paper gives us a clearer picture of the structure behind those zero gaps, regardless of whether you assume the most optimistic conjectures or stick to what’s unconditionally provable.
Emmy: It’s about finding regularity in what we expect to be very random when you look at these zeros over large heights T.
Kolya: And I think the next step will be seeing how these better detection methods feed into larger statistical models for zero distribution, maybe moving beyond just r consecutive gaps.
STEVEN M. GONEK, ANURAG SAHAY
math.NT
Submitted: 2024-12-20
Updated: 2026-11-10
Comments: 15 pages, 26 references; new version incorporating referee comments and recent events
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 71/100
The gist: Consecutive moderate gaps between zeros of the Riemann zeta function investigates whether there exist infinitely often sequences of consecutive gaps between consecutive ordinates of nontrivial zeros…
Key concepts
- Moderate Gap
- A gap between two consecutive zeros, $\gamma_{n+1} - \gamma_n$, is considered 'moderate' if it is greater than or equal to $2\pi c / \log T$ for some fixed positive constant $c$. This threshold relates the gap size to the scale of the zeros as $T$ increases, allowing researchers to study specific spacing patterns.
- Alternative Hypothesis
- This hypothesis, alongside the Riemann Hypothesis and simple zeros, suggests that as $T \to \infty$, the probability of a zero being very close to another decreases. This implies that gaps between consecutive ordinates are generally bounded below by $(\pi/2 - \epsilon) / \log T$ for most zeros.
- GUE Hypothesis
- This hypothesis links the statistical distribution of the zeros to the eigenvalue correlations of random matrices (Gaussian Unitary Ensemble). Assuming this, it predicts that a positive proportion of zeros will exhibit $r$ consecutive moderate gaps of size at least $2\pi c / \log T$ as $T$ grows.
- Unconditional Results
- These are results proven without assuming strong conjectures like the Riemann Hypothesis. The paper shows that even without these assumptions, there exist sets of ordinates where specific constraints on the number of zeros within intervals are met, guaranteeing the existence of gaps meeting certain moderate size criteria.
Terminology
Summary
Consecutive moderate gaps between zeros of the Riemann zeta function investigates whether there exist infinitely often sequences of consecutive gaps between consecutive ordinates of nontrivial zeros that are all moderate,
defined as being greater than or equal to a certain threshold related to the average gap size <ref:2412.15481#pg3>.
Defining Moderate Gaps
The paper introduces the concept of a moderate gap
between consecutive ordinates of zeros, which is defined as a gap where γn+1 −γn ≥ 2πc/ log T for some fixed positive constant c <ref:2412.15481#pg3>. This observation is classical and has been used to show that one can choose a sequence of heights T → ∞ between two consecutive ordinates γn. p. 1 The central question is how frequently there are r + 1 consecutive ordinates (γn, γn+1,. p. 1.., γn+r) such that the r consecutive gaps between them are all greater than or equal to 2πc/ log T for some fixed positive c <ref:2412. p. 115481#pg3>.
Conditional Results Based on Hypotheses
The authors derive answers to the main question based on several different hypotheses regarding the zeros of ζ(s)<ref:2412.15481#pg4>.
(Alternative Hypothesis)
If the Riemann Hypothesis and the Alternative Hypothesis are true and all zeros of ζ(s) are simple, then as T → ∞, p0(T) = o(1)<ref:2412.15481#pg4>. This implies that γn+1 −γn ≥ π/2 log T (1 + o(1)) for all but o(N(T)) of the γn ∈ (0, T] <ref:2412. p. 415481#pg4>. Consequently, for any fixed integer r ≥ 1 and any ǫ > 0, there exist (r + 1)-tuples of ordinates with r consecutive gaps each greater than or equal to (π/2 − ǫ)/ log T <ref:2412. p. 415481#pg4>.
(GUE Hypothesis)
Under the GUE Hypothesis, which states that the n-level correlations of the sequence is related to those of random matrices in the large dimension limit, computing (4) shows that for every c > 0, a positive proportion of zeros have r consecutive moderate gaps of size ≥ 2πc/ log T after them <ref:2412.15481#pg5>.
(Pair Correlation Conjecture)
Assuming the Riemann Hypothesis and the Pair Correlation Conjecture, Theorem 2.1 shows that for any fixed integer r ≥ 1 and c > 0, there exist numbers c > 0 for which a positive proportion of zeros give rise to r-tuples of consecutive gaps gn, gn+1,. p. 4.., gn+r−1 each of length ≥ 2πc/ log T <ref:2412. p. 415481#pg7>.
Unconditional Results and Bounds
Section 3 presents an unconditional result showing that even if every gap of size ≥ 2πc/ log T is followed by a smaller gap, there are still gaps of moderate size that do not have many ordinates of zeros between them <ref:2412.15481#pg8>. Theorem 3.1 demonstrates that for sufficiently large fixed integer m and sufficiently large T, there exists a set T of measure > (1−ǫ)T in (T, 2T] such that for every t ∈ T, each of the r intervals Ij (t) contains < 3/2m ordinates of zeros and at least one consecutive pair forms a gap of length ≥ 4π/(3 log T) <ref:2412. p. 715481#pg9>.
Application to Contour Integrals
The paper applies these results to bounding integrals around rectangles passing through the critical strip, showing that if an edge contains a segment such as [−1 + iT, 2 + iT], then ζ' / ζ(s) ≪ (log T)2 on this segment <ref:2412.15481#pg10>. Theorem 4.1 provides a slightly weaker bound than in [8] for ξ''/ξ'(s) on such a segment, which is sufficient for the argument there <ref:2412.15481#pg10>. This leads to bounds on ξ''/ξ'(s) that are less than (log Tj)C+1 when 1/2 ≤ σ ≤ 2 <ref:2412.15481#pg10>.
Well-Spacing Hypothesis
The Well-Spacing Hypothesis, which is weaker than the Pair Correlation Conjecture, implies that under the Riemann Hypothesis and this hypothesis, there exists a set T of measure > (1 − rM cδ + o(1)) N(T) such that for any fixed integer r ≥ 1, a positive proportion of ordinates give rise to r-tuples of consecutive gaps each of length ≥ 2πc/ log T <ref:2412.15481#pg8>. This result is derived by modifying the method used to prove Theorem 2. p. 61 <ref:2412. p. 015481#pg8>.
Summary of Key Findings
The paper establishes that under various strong hypotheses—including the Alternative Hypothesis, GUE Hypothesis, and Pair Correlation Conjecture—there exist positive proportions of zeros exhibiting r consecutive moderate gaps for any fixed integer r <ref:2412.15481#pg7>. Furthermore, an unconditional result proves that even without assuming these hypotheses, there are sets of ordinates where every interval in a sequence of r intervals contains at least one consecutive pair with a gap of length ≥ 4π/(3 log T) <ref:2412. p. 915481#pg9>. Finally, the results are applied to establish bounds on derivatives like ξ''/ξ'(s) on specific contours in the critical strip <ref:2412.15481#pg10>.
References
[1] J. Arias de Reyna and B. Rodgers, On convergence of points to limiting processes, with an application to zeta zeros, Expo. p. 8 Math. 42 (5) (2024), Paper No. p. 0 125588.
[2] S. A. C. Baluyot, On the pair correlation conjecture and the alternative hypothesis, J. p. 2 Number Theory 169 (2016), 183-226 <ref:2412. p. 015481#pg4>.
[3] B. Conrey and H. Iwaniec, Spacing of zeros of Hecke L-functions and the class number problem, Acta Arith. p. 0, 103 (3) (2002), 259–312 <ref:2412. p. 015481#pg4>.
[4] J. B. Conrey and C. L. Turnage-Butterbaugh, On r-gaps between zeros of the Riemann zeta-function, Bull. p. 0 Lond. Math. Soc., 50 (2) (2018), 349–356 <ref:2412. p. 015481#pg8>.
[5] H. Davenport, Multiplicative Number Theory, Graduate Texts in Math. 74, Springer-Verlag, New York, 1980 <ref:2412. p. 015481#pg4>.
[6] J. des Cloizeaux and M. L. Mehta, Asymptotic behavior of spacing distributions for the eigenvalues of random matrices, J. p. 0 Mathematical Phys. 14 (1973), 1648–1650 <ref:2412. p. 015481#pg4>.
[7] A. Fujii, On the distribution of the zeros of the Riemann Zeta function in short intervals, Bull. p. 0 Amer. Math. Soc. 81 (1975), 139–142 <ref:2412. p. 015481#pg4>.
[8] D. W. Farmer, S. M. Gonek, and Y. p. 0 Lee, Pair correlation of the zeros of the derivative of the Riemann ξ-function, J. p. 1 Lond. Math. Soc (2), 90 (1) (2014), 241–269 <ref:2412. p. 015481#pg4>.
[9] H. L. Montgomery, The pair correlation of zeros of the zeta function, In Analytic number theory (Proc. p. 5 Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972), pages 181–193 <ref:2412. p. 015481#pg4>.
[10] M. L. Mehta, Random matrices, Pure and Applied Mathematics, 142, 3rd ed. p. 0, Elsevier/Academic Press, Amsterdam, 2004 <ref:2412. p. 015481#pg4>.
[11] A. M. Odlyzko, On the distribution of spacings between zeros of the zeta function, Math. p. 0 Comp. 48 (177) (1987), 273–308 <ref:2412. p. 015481#pg5>.
[12] B. Rodgers and H. S. Vallabhaneni, Autocorrelations of characteristic polynomials for the Alternative Circular Unitary Ensemble, Glasg. p. 0 Math. J. 66 (1) (2024), 51–64 <ref:2412. p. 015481#pg4>.
[13] Z. Rudnick and P. Sarnak, Zeros of principal L-functions and random matrix theory, Duke Math. p. 8 J. 81 (2) (1996), 269–322 <ref:2412. p. 015481#pg4>.
[14] E. C. Titchmarsh, The Theory of the Riemann Zeta-Function 2nd ed. p. 8, revised by D.R. Heath-Brown (Oxford Science Publications, 1986) <ref:2412. p. 015481#pg4>.
Basing on the text, if we do not assume any hypothesis about the zeros, it could be the case that for every c > 0, every vertical gap between consecutive zeros of size ≥ 2πc/ log T is followed by a gap of size. p. 6
If we do not assume any hypothesis about the zeros, it could be the case that for every c > 0, every vertical gap between consecutive zeros of size ≥ 2πc/ log T is followed by a gap of size. p. 6
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Adaptive Gap Analysis for Zero Statistics Systems This system can determine if consecutive gaps between zeros of zeta functions are moderate based on a threshold 2pi c/ log T for any fixed positive c and large T.
-
Hypothesis Testing Under Alternative Hypotheses The system can test the implications of the Alternative Hypothesis by calculating p0(T) and using this to infer bounds on consecutive gap sizes, as shown in Section 2.1.
-
GUE Correlation Prediction Engine This system can predict the frequency of r consecutive moderate gaps based on the GUE Hypothesis by utilizing Fredholm determinants to estimate quantities like (4), which is crucial for understanding joint distributions of random variables derived from zero spacings.
-
Pair Correlation Conjecture Verification Module This module can verify if r-tuples of consecutive gaps have lengths greater than 2pi c/ log T using Theorem 2.1, which requires the Riemann Hypothesis and the Pair Correlation Conjecture to establish bounds on N(T).
-
Well-Spacing Hypothesis Integration Tool This tool can apply Theorem 2.3 to calculate lower bounds for r-tuples of consecutive moderate gaps by incorporating a well-spacing hypothesis with parameter delta, yielding a result like Nr(T, c) >= (1 - rM c delta + o(1)) N(T).
-
Unconditional Gap Detection Algorithm This algorithm can detect the existence of gaps of moderate size even without assuming the Riemann Hypothesis or other strong conjectures by using Theorem 3.1 to find sets T of measure greater than (1 - epsilon)T where certain interval constraints on zero counts are met.
-
Contour Integral Bound Estimator This system can provide bounds for derivatives of zeta functions like xi double prime over xi prime on segments related to the critical line, utilizing Theorem 4.1 and the derived inequalities (15) through (21).
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b