相关论文: Numerical Computation of \prod_{n=1}^\infty (1 - t…

The classical Mertens' formula states that $ \prod_{p\le N}\big(1-\frac1p)^{-1}\sim e^\gamma\log N, $ where the product is over all primes $p$ less than or equal to $N$, and $\gamma$ is the Euler-Mascheroni constant. By the Euler product…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

We present the singular Euler--Maclaurin expansion, a new method for the efficient computation of large singular sums that appear in long-range interacting systems in condensed matter and quantum physics. In contrast to the traditional…

Given a known function $f : [0, 1] \mapsto (0, 1)$ and a random but almost surely finite number of independent, Ber$(x)$-distributed random variables with unknown $x \in [0, 1]$, we construct an unbiased, $[0, 1]$-valued estimator of the…

One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…

We establish closed-form expressions for the infinite series sum from n=2 to infinity of arctanh(n^-k) for all integers k >= 2 by connecting these sums to infinite product formulas involving the gamma function. Our approach uses logarithmic…

It is proved that if $T$ is sufficiently large, then uniformly for all positive integers $\ell \leqslant (\log T) / (\log_2 T)$, we have \begin{equation*} \max_{T\leqslant t\leqslant 2T}\left|\zeta^{(\ell)}\Big(1+it\Big)\right| \geqslant…

Product identities in two variables $x, q$ expand infinite products as infinite sums, which are linear combinations of theta functions; famous examples include Jacobi's triple product identity, Watson's quintuple identity, and Hirschhorn's…

We study integration and $L^2$-approximation of functions of infinitely many variables in the following setting: The underlying function space is the countably infinite tensor product of univariate Hermite spaces and the probability measure…

We here first study the state space realization of a tensor-product of a pair of rational functions. At the expense of "inflating" the dimensions, we recover the classical expressions for realization of a regular product of rational…

The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…

For Dirichlet $L$-functions in $\mathbb{F}_q [T]$ we obtain a hybrid Euler-Hadamard product formula. We make a splitting conjecture, namely that the $2k$-th moment of the Dirichlet $L$-functions at $\frac{1}{2}$, averaged over primitive…

The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…

In an optimal control framework, we consider the value $V_T(x)$ of the problem starting from state $x$ with finite horizon $T$, as well as the value $V_\lambda(x)$ of the $\lambda$-discounted problem starting from $x$. We prove that uniform…

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…

We discover an explicit expansion formula for the powers $s$ of the Euler Product (or Dedekind $\eta$-function) in terms of hook lengths of partitions, where the exponent $s$ is any complex number. Several classical formulas have been…

It is known to be difficult to find out whether a certain multivariable function to be a characteristic function when its corresponding measure is not tirivial to be or not to be a probability measure on R^d. Such results were not obtained…

This paper considers the computation of the matrix exponential $\mathrm{e}^A$ with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with…

Brent and McMillan introduced in 1980 a new algorithm for the computation of Euler's constant $\gamma$, based on the use of the Bessel functions I\_0(x) and K\_0(x). It is the fastest known algorithm for the computation of $\gamma$. The…

We provide heuristic computations \`a la Euler of the regularized infinite products of Gauss and Eisenstein integers and primes. Our approach, yielding explicit expressions, is inspired by the work by Mu\~noz Garc\'ia and P\'erez-Marco, who…