Zeta Function Research Articles

On the Connection Between Irrationality Measures and Polynomial Continued Fractions

AbstractLinear recursions with integer coefficients, such as the recursion that generates the Fibonacci sequence $${F}_{n}={F}_{n-1}+{F}_{n-2}$$ F n = F n - 1 + F n - 2 , have been intensely studied over millennia and yet still hide interesting undiscovered mathematics. Such a recursion was used by Apéry in his proof of the irrationality of $$\zeta \left(3\right)$$ ζ 3 , which was later named the Apéry constant. Apéry’s proof used a specific linear recursion that contained integer polynomials (polynomially recursive) and formed a continued fraction; such formulas are called polynomial continued fractions (PCFs). Similar polynomial recursions can be used to prove the irrationality of other fundamental constants such as $$\pi$$ π and $$e$$ e . More generally, the sequences generated by polynomial recursions form Diophantine approximations, which are ubiquitous in different areas of mathematics such as number theory and combinatorics. However, in general it is not known which polynomial recursions create useful Diophantine approximations and under what conditions they can be used to prove irrationality. Here, we present general conclusions and conjectures about Diophantine approximations created from polynomial recursions. Specifically, we generalize Apéry’s work from his particular choice of PCF to any general PCF, finding the conditions under which a PCF can be used to prove irrationality or to provide an efficient Diophantine approximation. To provide concrete examples, we apply our findings to PCFs found by the Ramanujan Machine algorithms to represent fundamental constants such as $$\pi$$ π , $$e$$ e , $$\zeta \left(3\right)$$ ζ 3 , and the Catalan constant. For each such PCF, we demonstrate the extraction of its convergence rate and efficiency, as well as the bound it provides for the irrationality measure of the fundamental constant. We further propose new conjectures about Diophantine approximations based on PCFs. Looking forward, our findings could motivate a search for a wider theory on sequences created by any linear recursions with integer coefficients. Such results can help the development of systematic algorithms for finding Diophantine approximations of fundamental constants. Consequently, our study may contribute to ongoing efforts to answer open questions such as the proof of the irrationality of the Catalan constant or of values of the Riemann zeta function (e.g., $$\zeta \left(5\right)$$ ζ 5 ).

Absolute zeta functions arising from ceiling and floor Puiseux polynomials

For the [Formula: see text]-lift [Formula: see text] of a monoid scheme [Formula: see text] of finite type, Deitmar et al. calculated its absolute zeta function by interpolating [Formula: see text] for all prime powers [Formula: see text] using the Fourier expansion. This absolute zeta function coincides with the absolute zeta function of a certain polynomial. In this paper, we characterize the polynomial as a ceiling polynomial of the sequence [Formula: see text], which we introduce independently. Extending this idea, we introduce a certain pair of absolute zeta functions of a separated scheme [Formula: see text] of finite type over [Formula: see text] by means of a pair of Puiseux polynomials which estimate “[Formula: see text]” for sufficiently large [Formula: see text]. We call them the ceiling and floor Puiseux polynomials of [Formula: see text]. In particular, if [Formula: see text] is an elliptic curve, then our absolute zeta functions of [Formula: see text] do not depend on its isogeny class.

A Modification to the Novel Toy Model of the Riemann Zeta Function Roots Equation

It is true that my previous series of papers about the Riemann Hypothesis has raised lots of discussions or the concerns among the mathematics society. Indeed, some professionals may think that the Riemann Zeta function at s = 1 or ∑_(n=1)^∞▒1/n is actually divergent and may tend to an infinity, how it can be acted as a denominator in a proof or something like 1/∞ ? This author’s idea is there may be no need to evaluate such kind of summation as one may consider the sum just as an (imaginary) constant (but NOT the complex number). Or we may only consider such summation as a kind of improper integrals with a black-boxed answer. In other words, the true final value of the summation ∑_(n=1)^∞▒1/n is NOT an concerning serious issue. The function ∑_(n=1)^∞▒1/n^s is in practice a smooth function and equals to log N or the logarithmic function for s = 1 or have the infinite differentiable properties except n = 0, that is why the commercial software Maple Soft can compute the Zeta function’s associated Taylor series successfully. In fact, from the above series together with the harmonic properties, one may calculate the artifical Zeta function’s root model equation such as the 0.5 +/- β*cot(ln(x))/(αx+1)n (will be discussed in my next paper of the series). Indeed, this is NOT the best model. Actually, the true Riemann Zeta non-trivial Root model equation is: {z = x + yI | z∈0.5±(y_1⩽y⩽y_2 )I} where y1= (±cot(k))/ln(k) , y2 = (±tan(k))/ln(k) with 0<k<2π. Certainly, this author cannot avoid mistakes. Some of the defects in the previous paper such as one in the linguistic proof of the RH will be stated and amended. Lastly, this author wants to remind that the present series of paper is first to establish a model equation for zeta function’s roots and the Plank’s like constant. This author then applies the telescopic and logarithmic methods for a 3 cases proof of the RH. Also, we have a Matlab code for the evaluation of RH complex contour integral. Finally, the RH problem will be transformed into a linguistic one and hence we may have solved the Riemann Hypothesis issue completely through a 4 cases of truth table collaborations with the logical inference [7] & [15] to the causality (structural) organization of the sentences [16] or just named as “Logical & Organized Context”.

Algorithm-assisted discovery of an intrinsic order among mathematical constants

In recent decades, a growing number of discoveries in mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces. As computers become more powerful, an intriguing possibility arises-the interplay between human intuition and computer algorithms can lead to discoveries of mathematical structures that would otherwise remain elusive. Here, we demonstrate computer-assisted discovery of a previously unknown mathematical structure, the conservative matrix field. In the spirit of the Ramanujan Machine project, we developed a massively parallel computer algorithm that found a large number of formulas, in the form of continued fractions, for numerous mathematical constants. The patterns arising from those formulas enabled the construction of the first conservative matrix fields and revealed their overarching properties. Conservative matrix fields unveil unexpected relations between different mathematical constants, such as π and ln(2), or e and the Gompertz constant. The importance of these matrix fields is further realized by their ability to connect formulas that do not have any apparent relation, thus unifying hundreds of existing formulas and generating infinitely many new formulas. We exemplify these implications on values of the Riemann zeta function ζ (n), studied for centuries across mathematics and physics. Matrix fields also enable new mathematical proofs of irrationality. For example, we use them to generalize the celebrated proof by Apéry of the irrationality of ζ (3). Utilizing thousands of personal computers worldwide, our research strategy demonstrates the power of large-scale computational approaches to tackle longstanding open problems and discover unexpected connections across diverse fields of science.

Norm bounds on Eisenstein series

We study the sup-norm bound (both individually and on average) for Eisenstein series on certain arithmetic hyperbolic orbifolds producing sharp exponents for the modular surface and Picard 3-fold. The methods involve bounds for Epstein zeta functions, and counting restricted values of indefinite quadratic forms at integer points.

Universal quadratic forms and Dedekind zeta functions

We study universal quadratic forms over totally real number fields using Dedekind zeta functions. In particular, we prove an explicit lower bound for the rank of universal quadratic forms over a given number field [Formula: see text], under the assumption that the codifferent of [Formula: see text] is generated by a totally positive element. Motivated by a possible path to remove that assumption, we also investigate the smallest number of generators for the positive part of ideals in totally real numbers fields.

Hamiltonian for the Hilbert–Pólya conjecture

We introduce a Hamiltonian to address the Hilbert–Pólya conjecture. The eigenfunctions of the introduced Hamiltonian, subject to the Dirichlet boundary conditions on the positive half-line, vanish at the origin by the nontrivial zeros of the Riemann zeta function. Consequently, the eigenvalues are determined by these nontrivial Riemann zeros. If the Riemann hypothesis (RH) is true, the eigenvalues become real and represent the imaginary parts of the nontrivial zeros. Conversely, if the Hamiltonian is self-adjoint, or more generally, admits only real eigenvalues, then the RH follows. In our attempt to demonstrate the latter, we establish the existence of a similarity transformation of the introduced Hamiltonian that is self-adjoint on the domain specified by an appropriate boundary condition, which is satisfied by the eigenfunctions through the vanishing of the Riemann zeta function. Our result can be extended to a broader class of functions whose zeros lie on the critical line.

Functional analysis on hypergraphs: Density and zeta functions – applications to molecular graphs and image analysis

This paper introduces new descriptors and invariants for hypergraphs. We develop a new type of Zeta functions and density functions, that are proved to have useful invariance and monotony properties. Links with hypergraph entropies are established as well. New matrices linked with hypergraphs are also proposed, from which a new type of Laplacian associated with hypergraphs is derived. Two applications are then suggested, molecular graphs in chemistry and image analysis, where the proposed functions and invariants are useful characterizations.

The Extension of the Riemann’s Zeta Function

In mathematics, the search for exact formulas giving all the prime numbers, certain families of prime numbers or the n-th prime number has generally proved to be vain, which has led to contenting oneself with approximate formulas [8]. The purpose of this article is to give a new proof of the Riemann hypothesis [4]-which is closely related to the distribution of prime numbers- by y introducing S^ a new extension of the of the Riemann zeta function.

Statistics of Local Level Spacings in Single- and Many-Body Quantum Chaos.

We introduce a notion of local level spacings and study their statistics within a random-matrix-theory approach. In the limit of infinite-dimensional random matrices, we determine universal sequences of mean local spacings and of their ratios which uniquely identify the global symmetries of a quantum system and its internal-chaotic or regular-dynamics. These findings, which offer a new framework to monitor single- and many-body quantum systems, are corroborated by numerical experiments performed for zeros of the Riemann zeta function, spectra of irrational rectangular billiards, and many-body spectra of the Sachdev-Ye-Kitaev Hamiltonians.

Multi‐lingual encryption technique using Unicode and Riemann zeta function and elliptic curve cryptography for secured routing in wireless sensor networks

AbstractSecure routing and communication with confidentiality based on encryption of texts in multiple natural languages are challenging issues in wireless sensor networks which are widely used in recent applications. The existing works on Elliptic Curve Cryptography based secured routing algorithms are focused only on the encryption and decryption of single language text encrypted over a Prime finite field. In this article, a new algorithm called Multi‐Language ECC encrypted Secure Routing algorithm with trust management is proposed, in order to ensure confidentiality and integrity which focuses on the encryption of plain text using Riemann's zeta function and Elliptic Curve Cryptography for improving the key strength which is applied for encryption over a range of multi languages namely Tamil, English, Hindi French and German which are supported by Unicode and routing the text security. From the experiments conducted using the proposed multi‐lingual encryption algorithm with network routing, we prove that the suggested method provides greater security than the current secure routing algorithms due to the use of Zeta function and Gamma function with ECC key and trust management. but also boasts reduced complexity compared to other existing multi‐lingual encryption algorithms.

Field Theory Expansions of String Theory Amplitudes.

Motivated by quantum field theory (QFT) considerations, we present new representations of the Euler-Beta function and tree-level string theory amplitudes using a new two-channel, local, crossing symmetric dispersion relation. Unlike standard series representations, the new ones are analytic everywhere except at the poles, sum over poles in all channels, and include contact interactions, in the spirit of QFT. This enables us to consider mass-level truncation, which preserves all the features of the original amplitudes. By starting with such expansions for generalized Euler-Beta functions and demanding QFT-like features, we single out the open superstring amplitude. We demonstrate the difficulty in deforming away from the string amplitude and show that a class of such deformations can be potentially interesting when there is level truncation. Our considerations also lead to new QFT-inspired, parametric representations of the Zeta function and π, which show fast convergence.

Negative discrete moments of the derivative of the Riemann zeta‐function

AbstractWe obtain conditional upper bounds for negative discrete moments of the derivative of the Riemann zeta‐function averaged over a subfamily of zeros of the zeta function that is expected to be arbitrarily close to full density inside the set of all zeros. For , our bounds for the ‐th moments are expected to be almost optimal. Assuming a conjecture about the maximum size of the argument of the zeta function on the critical line, we obtain upper bounds for these negative moments of the same strength while summing over a larger subfamily of zeta zeros.

Zeros of higher derivatives of Riemann zeta function

In this article, we extend the result of Conrey [4, Theorem 2] to shorter intervals for higher-order derivatives of the zeta function. That is we study the mean value of the product of two finite order derivatives of the zeta function multiplied by a mollifier in short intervals. In this process, we obtain better mollifier length in some short intervals compared to the length of mollifier implied by Conrey's result. These finer studies allow us to refine the error term of some classical results of Levinson and Montgomery [13], Ki and Lee [11] on zero density estimates of ζ(k). Further, we showed that almost all non-trivial zeros of Matsumoto-Tanigawa's ηk-function cluster near the critical line.

Quantitative upper bounds related to an isogeny criterion for elliptic curves

AbstractFor and elliptic curves defined over a number field , without complex multiplication, we consider the function counting nonzero prime ideals of the ring of integers of , of good reduction for and , of norm at most , and for which the Frobenius fields and are equal. Motivated by an isogeny criterion of Kulkarni, Patankar, and Rajan, which states that and are not potentially isogenous if and only if , we investigate the growth in of . We prove that if and are not potentially isogenous, then there exist positive constants , , and such that the following bounds hold: (i) ; (ii) under the Generalized Riemann Hypothesis for Dedekind zeta functions (GRH); (iii) under GRH, Artin's Holomorphy Conjecture for the Artin ‐functions of number field extensions, and a Pair Correlation Conjecture for the zeros of the Artin ‐functions of number field extensions.

On Some Multipliers Related to Discrete Fractional Integrals

This paper explores the properties of multipliers associated with discrete analogues of fractional integrals, revealing intriguing connections with Dirichlet characters, Euler’s identity, and Dedekind zeta functions of quadratic imaginary fields. Employing Fourier transform techniques, the Hardy–Littlewood circle method, and a discrete analogue of the Stein–Weiss inequality on product space through implication methods, we establish ℓp→ℓq bounds for these operators. Our results contribute to a deeper understanding of the intricate relationship between number theory and harmonic analysis in discrete domains, offering insights into the convergence behavior of these operators.

Multivariate and Matrix-Variate Logistic Models in the Real and Complex Domains

Several extensions of the basic scalar variable logistic density to the multivariate and matrix-variate cases, in the real and complex domains, are given where the extended forms end up in extended zeta functions. Several cases of multivariate and matrix-variate Bayesian procedures, in the real and complex domains, are also given. It is pointed out that there are a range of applications of Gaussian and Wishart-based matrix-variate distributions in the complex domain in multi-look data from radar and sonar. It is hoped that the distributions derived in this paper will be highly useful in such applications in physics, engineering, statistics and communication problems, because, in the real scalar case, a logistic model is seen to be more appropriate compared to a Gaussian model in many industrial applications. Hence, logistic-based multivariate and matrix-variate distributions, especially in the complex domain, are expected to perform better where Gaussian and Wishart-based distributions are currently used.

Large deviations of the argument of the Riemann zeta function

AbstractLet . We prove an unconditional lower bound on the measure of the sets for . For , our bound has a Gaussian shape with variance proportional to . At the endpoint, , our result implies the best known ‐theorem for that is due to Tsang. We also explain how the method breaks down for given our current knowledge about the zeros of the zeta function. Conditionally on the Riemann hypothesis, we extend our results to the range .

Modular relations involving generalized digamma functions

Generalized digamma functions ψk(x), studied by Ramanujan, Deninger, Dilcher, Kanemitsu, Ishibashi etc., appear as the Laurent series coefficients of the Hurwitz zeta function. In this paper, a modular relation of the form Fk(α)=Fk(1/α) containing infinite series of ψk(x), or, equivalently, between the generalized Stieltjes constants γk(x), is obtained for any k∈N. When k=0, it reduces to a famous transformation given on page 220 of Ramanujan's Lost Notebook. For k=1, an integral containing Riemann's Ξ-function, and corresponding to the aforementioned modular relation, is also obtained along with its asymptotic expansions as α→0 and α→∞. Carlitz-type and Guinand-type finite modular relations involving ψj(m)(x),0≤j≤k,m∈N∪{0}, are also derived, thereby extending previous results on the digamma function ψ(x). The extension of Guinand's result for ψj(m)(x),m≥2, involves an interesting combinatorial sum h(r) over integer partitions of 2r into exactly r parts. This sum plays a crucial role in an inversion formula needed for this extension. This formula has connection with the inversion formula for the inverse of a triangular Toeplitz matrix. The modular relation for ψj′(x) is subtle and requires delicate analysis.

The Generalized Eta Transformation Formulas as the Hecke Modular Relation

The transformation formula under the action of a general linear fractional transformation for a generalized Dedekind eta function has been the subject of intensive study since the works of Rademacher, Dieter, Meyer, and Schoenberg et al. However, the (Hecke) modular relation structure was not recognized until the work of Goldstein-de la Torre, where the modular relations mean equivalent assertions to the functional equation for the relevant zeta functions. The Hecke modular relation is a special case of this, with a single gamma factor and the corresponding modular form (or in the form of Lambert series). This has been the strongest motivation for research in the theory of modular forms since Hecke’s work in the 1930s. Our main aim is to restore the fundamental work of Rademacher (1932) by locating the functional equation hidden in the argument and to reveal the Hecke correspondence in all subsequent works (which depend on the method of Rademacher) as well as in the work of Rademacher. By our elucidation many of the subsequent works will be made clear and put in their proper positions.