Next Article in Journal
mKdV Equation on Time Scales: Darboux Transformation and N-Soliton Solutions
Previous Article in Journal
New Flexible Asymmetric Log-Birnbaum–Saunders Nonlinear Regression Model with Diagnostic Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Approximation of the Hardy Z-Function via High-Order Sections

Faculty of Sciences, Holon Institute of Technology, Ya’akov Fichman St. 18, Holon 5810201, Israel
Axioms 2024, 13(9), 577; https://doi.org/10.3390/axioms13090577 (registering DOI)
Submission received: 17 June 2024 / Revised: 12 August 2024 / Accepted: 23 August 2024 / Published: 25 August 2024
(This article belongs to the Special Issue Numerical Methods and Approximation Theory)

Abstract

:
The Z-function is the real function given by Z ( t ) = e i θ ( t ) ζ 1 2 + i t , where ζ ( s ) is the Riemann zeta function, and θ ( t ) is the Riemann–Siegel theta function. The function, central to the study of the Riemann hypothesis (RH), has traditionally posed significant computational challenges. This research addresses these challenges by exploring new methods for approximating Z ( t ) and its zeros. The sections of Z ( t ) are given by Z N ( t ) : = k = 1 N cos ( θ ( t ) ln ( k ) t ) k for any N N . Classically, these sections approximate the Z-function via the Hardy–Littlewood approximate functional equation (AFE) Z ( t ) 2 Z N ˜ ( t ) ( t ) for N ˜ ( t ) = t 2 π . While historically important, the Hardy–Littlewood AFE does not sufficiently discern the RH and requires further evaluation of the Riemann–Siegel formula. An alternative, less common, is Z ( t ) Z N ( t ) ( t ) for N ( t ) = t 2 , which is Spira’s approximation using higher-order sections. Spira conjectured, based on experimental observations, that this approximation satisfies the RH in the sense that all of its zeros are real. We present a proof of Spira’s conjecture using a new approximate equation with exponentially decaying error, recently developed by us via new techniques of acceleration of series. This establishes that higher-order approximations do not need further Riemann–Siegel type corrections, as in the classical case, enabling new theoretical methods for studying the zeros of zeta beyond numerics.

1. Introduction

1.1. Riemann’s Analytic Extension of Zeta

The Riemann zeta function is given by ζ ( s ) : = n = 1 n s in the range R e ( s ) > 1 . In his revolutionary 1859 work [1], Riemann extended the zeta function ζ ( s ) analytically to a meromorphic function on the entire complex plane with a single pole at s = 1 . This extension allowed him to explore the zeta function from a complex analytic perspective, uncovering its profound connection to the distribution of prime numbers. Riemann’s analytic continuation of ζ ( s ) is given by the integral representation:
ζ ( s ) = Γ ( 1 s ) 2 π i ( x ) s e x 1 d x x .
Although the integral representation outlined in Equation (1) was of tremendous importance for Riemman’s theoretical explorations in his manuscript, it is not amenable for direct computations. To practically compute ζ ( s ) , asymptotic techniques are required.

1.2. The Approximate Functional Equation (AFE) and the Riemann–Siegel Formula

The development of the AFE for the Z-function due to Hardy and Littlewood, marks a cornerstone in the computation methods of zeta [2,3,4,5]. The Hardy Z-function, denoted as Z ( t ) , is the real function defined by
Z ( t ) = e i θ ( t ) ζ 1 2 + i t
where θ ( t ) is the Riemann–Siegel θ -function, given by the equation
θ ( t ) = arg Γ 1 4 + i t 2 t 2 log ( t ) ,
see [6,7]. The Hardy–Littlewood approximation is encapsulated in the formula
Z ( t ) = 2 k = 1 N ˜ ( t ) c o s ( θ ( t ) l n ( k ) t ) k + R ( t ) ,
where N ˜ ( t ) = t 2 π , and the error term is given by
R ( t ) = O 1 t .
This representation, while powerful, for many purposes, requires further refinement of the error term R ( t ) to enhance the level of precision.
In the 1930’s, C. L. Siegel uncovered previously unpublished notes by Riemann which revealed that, remarkably, Riemann not only knew the Hardy–Littlewood Formula (4) but also developed complex asymptotic saddle point techniques which enable the required further evaluation of its error term R ( t ) for any order [6,8]. For instance, expanded to first-order, the Riemann–Siegel formula gives
R ( t ) = ( 1 ) N ( t ) 1 t 2 π 1 4 c o s ( 2 π ( p 2 p 1 16 ) ) c o s ( 2 π p ) + O 1 t 3 4 ,
where p = t 2 π N ˜ ( t ) . As an asymptotic formula, for a given specific value of t, indefinitely increasing the order of the expansion does not guarantee improved approximation. It is conjectured by Berry and Keating [9] that, when expanded to its optimal order, the Riemann–Siegel formula can reach the accuracy level of exponentially decaying error O e π t .
Since its introduction, the Riemann–Siegel formula, especially when enhanced with the Odlyzko–Schönhage algorithm [10], has been the main method for numerical verification of the RH, see [11,12,13,14,15,16,17]. The most comprehensive verification to date, achieved by Platt and Trudigian, confirms the RH up to 3 · 10 12 , see [18]. However, it can be argued that one of the great challenges in the Riemann hypothesis is the fact that while the Riemann–Siegel formula gives efficient methods for the numerical estimation of R ( t ) to any given order, it offers little analytical insight on its structure, crucial for the understanding of the properties of the zeros in general, especially as the order of its expansion increases due to the complexity of the expressions involved. It should be noted that recently, various alternative methods have been suggested, see [19,20,21].

1.3. Sections of the Z-Function and Spira’s Approximation

In [22,23], Spira introduced the notion of sections of the AFE of Z ( t ) , which are essentially defined by
Z N ( t ) : = k = 1 N c o s ( θ ( t ) l n ( k ) t ) k ,
and conducted a study of their zeros for any N N . In particular, Spira noted that the sections of Z ( t ) give an additional approximation of the function to that of the AFE
Z ( t ) = Z N ( t ) ( t ) + O 1 t ,
at the higher range N ( t ) = t 2 .
This approximation and its proof most certainly pre-date Spira and were probably already known to Riemann, see Theorem 1.8 of [24] for a variant. For instance, Figure 1 shows the values of the sections Z N ( t ) for the fixed value of t = 3000 and N = 1 , , 1500 (blue), the Hardy–Littlewood approximation of 1 2 Z ( 3000 ) (green) and Spira approximation Z ( 3000 ) (brown):
For numerical computations, employing (4) coupled with the Riemann–Siegel formula is clearly more efficient than utilizing Spira’s approximation, for the following reasons:
  • The number of terms required for Spira’s approximation, N ( t ) = t 2 , increases quadratically compared to N ˜ ( t ) = t 2 π required by (4), making it far more costly for numerical calculations. This alone likely made (8), even if folklorically known, impractical for computational use, particularly before the advent of computers.
  • The theoretical asymptotic estimation of Spira’s approximation error, obtained by classical means, is O 1 t , which is similar to that of the Hardy–Littlewood formula, before the application of the Riemann–Siegel expansion of the error whose first term already gives an error of order O t 3 4 . It should be noted, however, that these are approximate results, and hence, this seemingly superior asymptotic bound does not necessarily ensure greater practical accuracy over Spira’s approximation.
A particularly noteworthy aspect of this additional approximation (8), however, is its unique properties when compared to the classical AFE.

1.4. Spira’s Conjecture and the Absence of Theoretical Justification

Despite being far more costly, Spira, through his empirical investigations, suggested that (8) might have a critical significance, see S.6 of [22]. Remarkably, contrary to the Hardy–Littlewood formula, this higher-range approximation does not seem to admit zeros off the real line. That is, it is sensitive enough to observe the RH without the need for the expansion of the error term, as in the classical Riemann–Siegel formula. Although not explicitly stated by Spira in the following form, this can be formalized as follows:
Conjecture 
(Spira’s RH for sections). All the non-trivial zeros of Z N ( t ) ( t ) are real.
Figure 2 shows l n | Z ( t ) | (orange) and compares between the Spira approximation l n | Z N ( t ) | with N = N ( t ) = 205 (blue-left) and the classical Hardy-Littlewood approximation l n | 2 Z N ( t ) | with N = N ˜ ( t ) = 8 (blue-right) in the range 412 < t < 419 :
Figure 2 illustrates an instance of two real zeros accurately predicted by Spira’s formula, as anticipated, but missed by the Hardy–Littlewood formula (highlighted here in red), which actually erroneously identifies them as complex zeros.
Spira’s conjecture, while grounded in empirical and experimental observations, lacks direct theoretical underpinnings. Our aim in this work is to present a theoretical justification for the phenomena observed in Spira’s conjecture of the advantage of the higher-order section Z N ( t ) ( t ) over the Hardy–Littlewood sections Z N ˜ ( t ) ( t ) , via our new techniques of accelerated approximations.

2. Spira’s Approximation and Accelerated Approximations

In [25], we have developed an AFE based on the accelerated global series for ζ ( s ) due to Hasse–Sondow, which admits an error of exponential decay, see also [26] for a further study of this formula. For the Z-function, we have the following variant of our accelerated formula:
Z ( t ) = Z ˜ N ( t ) ( t ) + O e ω t ,
where
Z ˜ N ( t ) : = n = 0 N 1 2 n + 1 k = 0 n n k c o s ( θ ( t ) l n ( k + 1 ) t ) k + 1 ,
with ω > 0 a certain positive constant computed in [25] and N ( t ) = t 2 is the same order as in Spira’s approximation. The following Figure 3 shows l n | Z ( t ) | (orange) and our approximation l n | Z ˜ N ( t ) ( t ) | with N = N ( t ) = 205 (blue) in the range 412 < t < 419 :
Figure 4 illustrates the content of formula (9) by displaying ln | R ( t ) | (blue) and the line ω · t (orange), where R ( t ) = Z ( t ) Z ˜ N ( t ) ( t ) is the error of (9), for the range 0 t 350 :
It should be noted that our approximation via the accelerated Z ˜ N ( t ) ( t ) actually achieves the superior accuracy expected to be attained by the Hardy–Littlewood AFE coupled with the Riemann–Siegel formula when evaluated at the optimal order, according to the Berry and Keating conjecture. Our main result is the following reformulation:
Proposition 1.
The Hardy Z-function can be approximated via
Z ( t ) = Z ˜ N ( t ) ( t ) + O e ω t ,
where
Z ˜ N ( t ) ( t ) = k = 1 N ( t ) α ˜ k a c c ( t ) cos ( θ ( t ) ln ( k ) t ) k
is the accelerated N-th section with the coefficients α k a c c ( t ) given by
α ˜ k a c c ( t ) : = n = k 1 N ( t ) 1 2 n + 1 n k 1 .
Proof. 
Denote by
β n , k ( t ) : = β n , k 0 c o s ( θ ( t ) l n ( k + 1 ) t ) k + 1 ,
where
β n , k 0 : = 1 2 n + 1 n k .
The accelerated formula is given as the sum of all the coefficients β n , k ( t ) within the triangle 0 n N ( t ) and 0 k n . In particular, summing first along the k indices leads to the definition of
A ( n , t ) = k = 0 n β n , k ( t ) .
The accelerated Formula (9) is thus given by the summation of A ( n , t ) for 0 n N ( t ) . Figure 5 illustrates the triangle of coefficients β n , k ( t ) and their possible summation orders:
On the other hand, changing the order of summation to be first along k 1 n N ( t ) for given k and then along 1 k N ( t ) leads to the definition of α ˜ k ( t ) and the required formula. □
It should be noted that our new Formula (17) is far more cost-efficient than the original accelerated Formula (10). Spira’s section can be written as
Z N ( t ) ( t ) = k = 1 N ( t ) α k s t e p ( t ) cos ( θ ( t ) ln ( k ) t ) k ,
where the coefficients α k s t e p ( t ) are given by the step function:
α k s t e p ( t ) : = 1 1 k N ( t ) 0 otherwise .
Figure 6 shows a comparison between the accelerated coefficients α ˜ k a c c ( t ) (blue) and the step coefficients α k s t e p ( t ) (orange) of Spira’s section for t = 400 and k = 1 , , 400 :
We thus have
Corollary 1.
The accelerated section Z ˜ N ( t ) ( t ) is related to Spira’s section Z N ( t ) ( t ) via a smoothing of the step coefficients α k s t e p ( t ) to obtain α ˜ k a c c ( t ) . Moreover,
l i m t | | α ˜ k a c c ( t ) α k s t e p ( t ) | | = 0
in the 2 norm.

3. Discussion and Conclusions

Sections of the Hardy Z-function are known to approximate the Hardy Z-function in two different ways: (a) The classical Hardy–Littlewood AFE given by 2 Z N ˜ ( t ) ( t ) in (4) and (b) Spira’s approximation given by Z N ( t ) ( t ) in (8). Although the AFE is more efficient and theoretically expected to be superior, Spira suggested, based on his numerical experimentations, that, in practice, his approximation might consistently satisfy the RH for any t R , in the sense that all of its zeros are real. This is in striking contrast to the properties of the AFE, which requires the further evaluation of the Riemann–Siegel formula for this purpose.
In this work, we have presented theoretical justification for this mysterious observation, based on our new techniques of the asymptotic analysis of series acceleration, developed in [25], where we introduced a new accelerated approximation satisfying
Z ( t ) = Z ˜ N ( t ) ( t ) + O ( e ω t ) ,
where ω > 0 is a certain positive constant. This approximation achieves the superior accuracy expected to be attained by the Hardy–Littlewood AFE coupled with the Riemann–Siegel formula when evaluated at the optimal order, according to the Berry and Keating conjecture. In general, for any sequence α k = ( α 1 , α 2 , ) 2 , set
Z ( t ; α k ) : = k = 1 α k c o s ( θ ( t ) l n ( k ) t ) k .
In a unified manner, we have shown in Proposition 1 that both Spira’s sections and our accelerated sections can be expressed as elements in this space
Z ˜ N ( t ) ( t ) = Z ( t ; α ˜ k a c c ( t ) ) ; Z N ( t ) ( t ) = Z ( t ; α k s t e p ( t ) ) ,
where α k s t e p ( t ) is defined in (18), and the definition of α k a c c ( t ) is defined in (13). Furthermore, Corollary 1 shows that
l i m t | | α ˜ k a c c ( t ) α k s t e p ( t ) | | = 0 .
This essentially implies that Spira’s section Z N ( t ) ( t ) asymptotically coincides with our accelerated sections Z ˜ N ( t ) ( t ) as t .
In conclusion, our results provide the required theoretical justification to the numerical phenomena observed by Spira. Indeed, the fact that the difference between the accelerated sections Z ˜ N ( t ) and the Hardy Z-function Z ( t ) itself is imperceptible, coupled with the convergence of Z N ( t ) ( t ) to Z ˜ N ( t ) at large t, establishes that Spira’s RH for sections is essentially equivalent to RH for Z ( t ) itself. Moreover, our results further motivate the definition of the new parametrized space of sections Z ( t ; α k ) and the study of the properties of their zeros with respect to variation in the parameters α k 2 , suggesting a promising direction for further exploration.
Finally, let us note that one of the features responsible for the notorious difficulty of the Riemann hypothesis is the fact that the Riemann–Siegel formula includes terms of the form (6) beyond the main Hardy–Littlewood sum (4). These correcting terms, while computationally feasible, present significant analytical challenges. We argue that the results of this work, showing that Spira’s higher-order sections, which do not require any further correction terms, already capture the location of the zeros, represent a substantial theoretical development, potentially enabling innovative approaches to studying the zeros of the Riemann zeta function.

Funding

This research received no external funding.

Data Availability Statement

The author declares that the data supporting the findings of this study are available within the paper or from the corresponding author upon reasonable request.

Conflicts of Interest

The author declares no conflicts of interest or competing interests relevant to the content of this article.

References

  1. Riemann, B. “Über die Anzahl der Primzahlen unter einer gegebenen Grösse.” Monatsberichte der Berliner Akademie. In Gesammelte Werke; Teubner: Leipzig, Germany, 1892; Reprinted by Dover: New York, NY, USA, 1953. [Google Scholar]
  2. Hardy, G.H.; Littlewood, J.E. Contributions to the Theory of the Riemann Zeta-Function and the Theory of the Distribution of Primes. Acta Math. 1918, 41, 119–196. [Google Scholar] [CrossRef]
  3. Hardy, G.H.; Littlewood, J.E. The zeros of Riemann’s zeta function on the critical line. Math. Z. 1921, 10, 283–317. [Google Scholar] [CrossRef]
  4. Hardy, G.H.; Littlewood, J.E. The Approximate Functional Equation in the Theory of the Zeta Function, with an Application to the Divisor-Problems of Dirichlet and Piltz. Proc. Lond. Math. Soc. 1923, 21, 39–74. [Google Scholar] [CrossRef]
  5. Hardy, G.H.; Littlewood, J.E. The approximate functional equations for ζ(s) and ζ2(s). Proc. Lond. Math. Soc. 1929, 29, 81–97. [Google Scholar] [CrossRef]
  6. Edwards, H.M. Riemann’s Zeta Function; Academic Press: New York, NY, USA, 1974. [Google Scholar]
  7. Ivić, A. The Theory of Hardy’s Z-Function; Cambridge University Press: Cambridge, UK, 2012. [Google Scholar]
  8. Siegel, C.L. Über Riemanns Nachlaß zur analytischen Zahlentheorie. In Quellen und Studien zur Geschichte der Mathematik, Astronomie und Physik, Abteilung B: Studien; Springer: Berlin/Heidelberg, Germany, 1932; Volume 2, pp. 45–80, Also in Gesammelte Abhandlungen; Springer: Berlin/Heidelberg, Germany, 1966; Volume 1. [Google Scholar]
  9. Berry, M.V.; Keating, J.P. The Riemann Zeros and Eigenvalue Asymptotics. SIAM Rev. 1999, 41, 236–266. [Google Scholar] [CrossRef]
  10. Odlyzko, A.M.; Schönhage, A. Fast algorithms for multiple evaluations of the Riemann zeta function. Trans. Am. Math. Soc. 1988, 309, 797–809. [Google Scholar] [CrossRef]
  11. Gourdon, X. The 1013 First Zeros of the Riemann Zeta Function, and Zeros Computation at Very Large Height. 2004. Available online: http://numbers.computation.free.fr/Constants/Miscellaneous/zetazeros1e13-1e24.pdf (accessed on 22 August 2024).
  12. Lehman, R.S. On the Distribution of Zeros of the Riemann Zeta Function. Proc. Lond. Math. Soc. 1970, 20, 303–320. [Google Scholar] [CrossRef]
  13. Odlyzko, A.M. On the distribution of spacings between zeros of the zeta function. Math. Comput. 1987, 48, 273–308. [Google Scholar] [CrossRef]
  14. Odlyzko, A.M. The 1020-th Zero of the Riemann Zeta Function and 175 Million of Its Neighbors. 1992. Unpublished Manuscript. Available online: https://www-users.cse.umn.edu/~odlyzko/unpublished/index.html (accessed on 22 August 2024).
  15. Titchmarsh, E.C. The Zeros of the Riemann Zeta-Function. Proc. R. Soc. London. Ser. Math. Phys. Sci. 1935, 151, 234–255. [Google Scholar] [CrossRef]
  16. Rosser, J.B.; Yohe, J.B.; Schoenfeld, L. Rigorous Computation and the Zeros of the Riemann Zeta-Function. In Congressional Proceedings of the International Federation for Information Processing; Spartan: Washington, DC, USA, 1969; pp. 70–76. [Google Scholar]
  17. Turing, A.M. Some calculations of the Riemann zeta-function. Proc. Lond. Math. Soc. Third Ser. 1953, 3, 99–117. [Google Scholar] [CrossRef]
  18. Platt, D.; Trudgian, T. The Riemann hypothesis is true up to 3·1012. In Bulletin of the London Mathematical Society; Wiley: London, UK, 2021. [Google Scholar] [CrossRef]
  19. Matiyasevich, Y. On some algebraic ways to calculate zeros of the Riemann zeta function. In Proceedings of the International Conference on Algebraic Informatics, Virtual Event, 27–29 October 2022; Springer: Cham, Switzerland, 2022; pp. 15–25. [Google Scholar]
  20. Beliakov, G.; Matiyasevich, Y. Approximation of Riemann’s zeta function by finite Dirichlet series: A multiprecision numerical approach. Exp. Math. 2015, 24, 150–161. [Google Scholar] [CrossRef]
  21. Cohen, H. Computational Number Theory, Past, Present, and Future. In Mathematics Going Forward; Morel, J.M., Teissier, B., Eds.; Lecture Notes in Mathematics; Springer: Cham, Switzerland, 2023; Volume 2313. [Google Scholar]
  22. Spira, R. Zeros of sections of the zeta function I. Math. Comput. 1966, 18, 542–550. [Google Scholar] [CrossRef]
  23. Spira, R. Zeros of approximate functional equations. Math. Comput. 1967, 21, 41–48. [Google Scholar] [CrossRef]
  24. Ivić, A. The Riemann Zeta-Function: Theory and Applications; Dover Publications: New York, NY, USA, 1985. [Google Scholar]
  25. Jerby, Y. An approximate functional equation for the Riemann zeta function with exponentially decaying error. J. Approx. Theory 2021, 265, 105551. [Google Scholar] [CrossRef]
  26. Paris, R.B. The asymptotic expansion of a sum appearing in an approximate functional equation for the Riemann zeta function. arXiv 2021, arXiv:2106.01371. [Google Scholar] [CrossRef]
Figure 1. Values of the sections Z N ( t ) for the fixed value of t = 3000 and N = 1 , , 1500 (blue), the Hardy-Littlewood approximation of 1 2 Z ( 3000 ) (green) and the Spira approximation Z ( 3000 ) (brown).
Figure 1. Values of the sections Z N ( t ) for the fixed value of t = 3000 and N = 1 , , 1500 (blue), the Hardy-Littlewood approximation of 1 2 Z ( 3000 ) (green) and the Spira approximation Z ( 3000 ) (brown).
Axioms 13 00577 g001
Figure 2. Graphs of l n | Z ( t ) | (orange) and the Spira approximation l n | Z N ( t ) | with N = N ( t ) = 205 (blue-left) and the classical Hardy–Littlewood approximation l n | 2 Z N ( t ) | with N = N ˜ ( t ) = 8 (blue-right) in the range 412 < t < 419 .
Figure 2. Graphs of l n | Z ( t ) | (orange) and the Spira approximation l n | Z N ( t ) | with N = N ( t ) = 205 (blue-left) and the classical Hardy–Littlewood approximation l n | 2 Z N ( t ) | with N = N ˜ ( t ) = 8 (blue-right) in the range 412 < t < 419 .
Axioms 13 00577 g002
Figure 3. Graphs of l n | Z ( t ) | (orange) and our accelerated approximation l n | Z ˜ N ( t ) ( t ) | of [25] with N = N ( t ) = 205 (blue) in the range 412 < t < 419 .
Figure 3. Graphs of l n | Z ( t ) | (orange) and our accelerated approximation l n | Z ˜ N ( t ) ( t ) | of [25] with N = N ( t ) = 205 (blue) in the range 412 < t < 419 .
Axioms 13 00577 g003
Figure 4. The graph of l n | R ( t ) | (blue) and the line ω · t (orange), where R ( t ) = Z ( t ) Z ˜ N ( t ) ( t ) is the error of formula (9), for the range 0 t 350 .
Figure 4. The graph of l n | R ( t ) | (blue) and the line ω · t (orange), where R ( t ) = Z ( t ) Z ˜ N ( t ) ( t ) is the error of formula (9), for the range 0 t 350 .
Axioms 13 00577 g004
Figure 5. The triangle of coefficients β n , k ( t ) with A ( n , t ) arising from the horizontal order of summation (red) and α ˜ k ( t ) arising from the vertical order of summation (blue).
Figure 5. The triangle of coefficients β n , k ( t ) with A ( n , t ) arising from the horizontal order of summation (red) and α ˜ k ( t ) arising from the vertical order of summation (blue).
Axioms 13 00577 g005
Figure 6. The accelerated coefficients α ˜ k a c c ( t ) (blue) and the step coefficients α k s t e p ( t ) (orange) of Spira’s section for t = 400 and k = 1 , , 400 .
Figure 6. The accelerated coefficients α ˜ k a c c ( t ) (blue) and the step coefficients α k s t e p ( t ) (orange) of Spira’s section for t = 400 and k = 1 , , 400 .
Axioms 13 00577 g006
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Jerby, Y. On the Approximation of the Hardy Z-Function via High-Order Sections. Axioms 2024, 13, 577. https://doi.org/10.3390/axioms13090577

AMA Style

Jerby Y. On the Approximation of the Hardy Z-Function via High-Order Sections. Axioms. 2024; 13(9):577. https://doi.org/10.3390/axioms13090577

Chicago/Turabian Style

Jerby, Yochay. 2024. "On the Approximation of the Hardy Z-Function via High-Order Sections" Axioms 13, no. 9: 577. https://doi.org/10.3390/axioms13090577

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop