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

We have proved in this paper that natural logarithm of consecutive number ratio, x/(x-1) approximates to 2/(2x - 1) where x is a real number except 1. Using this relation, we, then proved, x approximates to double the sum of odd harmonic…

We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…

We provide rapidly converging formulae for the Riemann zeta function at odd integers using the Lambert series $\mathscr{L}_q(s) = \sum_{n=1}^\infty n^{s} q^{n}/(1-q^n)$, $s=-(4k\pm 1)$. Our main formula for $\zeta(4k-1)$ converges at rate…

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…

The Dirichlet series associated to the eta-product $\eta(7\tau)^7/\eta(\tau)$ decomposes uniquely into the difference of two L-functions with Euler products. This expression gives a new proof of the positivity of the Fourier coefficients of…

In 1997 the author found a criterion for the Riemann hypothesis for the Riemann zeta function, involving the nonnegativity of certain coefficients associated with the Riemann zeta function. In 1999 Bombieri and Lagarias obtained an…

An elementary method of computing the values at negative integers of the Riemann zeta function is presented. The principal ingredient is a new q-analogue of the Riemann zeta function. We show that for any argument other than 1 the classical…

For a uniform process $\{ X_t: t\in E\}$ (by which $X_t $ is uniformly distributed on $(0,1)$ for $t\in E$) and a function $w(x)>0$ on $(0,1)$, we give a sufficient condition for the weak convergence of the empirical process based on $\{…

We introduce an infinite family of approximations for a Dirichlet $L$-function $L(s, \chi)$ arising from truncated Euler products. These approximations are entire functions and satisfy the same functional equation as $L(s, \chi)$. We…

We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…

For a connected real Lie group $G$ we consider the canonical standard-ordered star product arising from the canonical global symbol calculus based on the half-commutator connection of $G$. This star product trivially converges on polynomial…

Using Cauchy's Integral Theorem as a basis, what may be a new series representation for Dirichlet's function $\eta(s)$, and hence Riemann's function $\zeta(s)$, is obtained in terms of the Exponential Integral function $E_{s}(i\kappa)$ of…

We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…

In this paper we study the Theta splitting function $\Theta(s+1)$, a function defined on the positive integers. We study the distribution of this function for sufficiently large values of the integers. As an application we show that…

Touchard-Riordan-like formulas are some expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove these kind of formulas, related with integer…

We state and prove product formulae for several generating functions for sequences $(a_n)_{n\ge0}$ that are defined by the property that $Pa_n+b^2$ is a square, where $P$ and $b$ are given integers. In particular, we prove corresponding…

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…

We give a simple proof for the reciprocity formulas of character Dedekind sums associated with two primitive characters, whose modulus need not to be same, by utilizing the character analogue of the Euler-MacLaurin summation formula.…

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.