Related papers: A nearly-optimal method to compute the truncated t…

The exact computation of permanent for high-dimensional tensors is a hard problem. Having in mind the applications of permanents in other fields, providing an algorithm for the approximation of tensor permanents is an attractive subject. In…

Properties of four quintic theta functions are developed in parallel with those of the classical Jacobi null theta functions. The quintic theta functions are shown to satisfy analogues of Jacobi's quartic theta function identity and…

Generalizations of classical theta functions are proposed that include any even number of analytic parameters for which conditions of quasi-periodicity are fulfilled and that are representations of extended Heisenberg group. Differential…

In this paper, we propose a general approach for improving the efficiency of computing distribution functions. The idea is to truncate the domain of summation or integration.

We use symmetric Poisson-Schwarz formulas for analytic functions $f$ in the half-plane ${Re}(s)>\frac12$ with $\bar{f(\bar{s})}=f(s)$ in order to derive factorisation theorems for the Riemann zeta function. We prove a variant of the…

In this short note we show the equivalence of Fourier expansion and Poisson summation approaches for the series approximation of the exponential function $\exp ({-{t^2}/4})$. The application of the Poisson summation formula is shown to…

This work is an extension of previous work by Alazah et al. [M. Alazah, S. N. Chandler-Wilde, and S. La Porte, Numerische Mathematik, 128(4):635-661, 2014]. We split the computation of the Fresnel Integrals into 3 cases: a truncated Taylor…

Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…

We derive a stronger uniqueness result if a function with compact support and its truncated Hilbert transform are known on the same interval by using the Sokhotski-Plemelj formulas. To find a function from its truncated Hilbert transform,…

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…

In this paper, we generalize the partial fraction decomposition which is fundamental in the theory of multiple zeta values, and prove a relation between Tornheim's double zeta functions of three complex variables. As applications, we give…

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The method can be used to compute a nested sequence of quadrature…

We consider the minimization problem of a sum of a number of functions having Lipshitz $p$-th order derivatives with different Lipschitz constants. In this case, to accelerate optimization, we propose a general framework allowing to obtain…

To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…

The zeta functions for the Schr\"odinger equation with a triangular potential are investigated. Values of the zeta functions are computed using both the Weierstrass factorization theorem and analytic continuation via contour integration.…

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

Let $T$ be the triangle with vertices (1,0), (0,1), (1,1). We study certain integrals over $T$, one of which was computed by Euler. We give expressions for them both as a linear combination of multiple zeta values, and as a polynomial in…

Given an arbitrary sequence $(\alpha_1, \ldots, \alpha_n) \in \mathbb{C}^n$, we show that the degree-$n$ truncation of the formal exponential $\exp\bigl(-\sum_{k=1}^{\infty} \frac{\alpha_k}{k} x^k\bigr)$ produces a polynomial whose roots…