Related papers: The Analytic Expression for Riemann's Prime Counti…
In this article, we develop four types of analytical recurrence formulas for non-trivial zeros of the Riemann zeta function on critical line assuming (RH). Thus, all non-trivial zeros up to the $n$th order must be known in order to generate…
An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…
We give a representation of the classical Riemann $\zeta$-function in the half plane $\Re s>0$ in terms of a Mellin transform involving the real part of the dilogarithm function with an argument on the unit circle (associated Clausen…
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…
In analytic number theory, the Selberg--Delange Method provides an asymptotic formula for the partial sums of a complex function $f$ whose Dirichlet series has the form of a product of a well-behaved analytic function and a complex power of…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
Because of its relation to the distribution of prime numbers, the Riemann zeta function {\zeta} (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with…
The following material was created with the idea of being used for an introductory fractional calculus course. A recapitulation of the history of fractional calculus is presented, as well as the different attempts at fractional derivatives…
Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series,…
In this paper we introduce some new methods to understand the analytic behaviour of the zeta function of a group. We can then combine this knowledge with suitable Tauberian theorems to deduce results about the growth of subgroups in a…
In one of his posthumous papers, conserved in G\"ottingen, Riemann considers the derivatives of $\log\zeta(s)$ at the point $1/2$, giving explicit values for them. Around 2010 we shared Riemann's value of the second derivative with some…
In this note concerning integrals involving the logarithm of the Riemann Zeta function, we extend some treatments given in previous pioneering works on the subject and introduce a more general set of Lorentz measures. We first obtain two…
The Ray-Singer analytic torsion is the zeta-function trace of a certain sum of logarithm operators on the de Rham complex. In this note we examine the residue analytic torsion, defined using the residue-trace instead of the spectral zeta…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…
First-order logic is a natural way of expressing properties of computation. It is traditionally used in various program logics for expressing the correctness properties and certificates. Although such representations are expressive for some…
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…