Search arXiv⌕ Search

arXiv · 0704.3448

Finite Euler products and the Riemann Hypothesis

Abstract

We show that if the Riemann Hypothesis is true, then in a region containing most of the right-half of the critical strip, the Riemann zeta-function is well approximated by short truncations of its Euler product. Conversely, if the approximation by products is good in this region, the zeta-function has at most finitely many zeros in it. We then construct a parameterized family of non-analytic functions with this same property. With the possible exception of a finite number of zeros off the critical line, every function in the family satisfies a Riemann Hypothesis. Moreover, when the parameter is not too large, they have about the same number of zeros as the zeta-function, their zeros are all simple, and they "repel". The structure of these functions makes the reason for the simplicity and repulsion of their zeros apparent and suggests a mechanism that might be responsible for the corresponding properties of the zeta-function's zeros. Computer evidence suggests that the zeros of functions in the family are remarkably close to those of the zeta-function (even for small values of the parameter), and we show that they indeed converge to them as the parameter increases. Furthermore, between zeros of the zeta-function, the moduli of functions in the family tend to twice the modulus of the zeta-function. Both assertions assume the Riemann Hypothesis. We end by discussing analogues for other L-functions and show how they give insight into the study of the distribution of zeros of linear combinations of L-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. M. Gonek. 2007-04-26. Finite Euler products and the Riemann Hypothesis. https://arxiv.org/abs/0704.3448

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized modular equations and the CM values of Hauptmoduln

Monstrous moonshine relates the representation of the Monster finite sporadic simple group to the distinguished modular functions, called Hauptmoduln. Chen-Yui~\cite{Chen-Yui} showed that the CM values of Hauptmoduln which appeare in monstrous moonshine (but not all) are algebraic integers, which is similar to the singular moduli of the $j$-function. In this paper, we generalize this result to Hauptmoduln whose $q$-coefficients are cyclotomic integers. A main idea for our proof is the use of generalized modular equations for Hauptmoduln, which was introduced by Cummins-Gannon~\cite{Cummins-Gannon} in the study of monstrous moonshine. As an application, we show that if a formal $q$-series satisfies the special combinatoric property called complete replicability, its CM values are algebraic integers, without assuming the modular invariance.

math.NT↗

On Graphical Partitions with Restricted Parts

An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed set. In this work, we investigate the probability that a uniformly random partition of an even integer $n$, subject to such restrictions, is graphical. We establish an upper bound on this probability expressed solely in terms of the Durfee square of the partition. Additionally, we evaluate the most-probable size of the Durfee square, depending solely on $n$ and the restrictions on the parts. Thus, we establish typical bounds on the probability that such random partitions are graphical. Our approach employs the Nash-Williams graphical condition, the saddle-point method and Edgeworth expansions.

math.NT↗