Related papers: A nearly-optimal method to compute the truncated t…
This paper develops an analytical method of truncating inequality constrained Gaussian distributed variables where the constraints are themselves described by Gaussian distributions. Existing truncation methods either assume hard…
In this note, we show that the values of integrals of the log-tangent function with respect to any square-integrable function on $\left[0 , \frac{\pi}{2} \right]$ may be determined by a finite or infinite sum involving the Riemann…
The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper begins the general study of…
Let $f: {\Bbb R}^n \longrightarrow {\Bbb R}$ be a positive definite quadratic form and let $y \in {\Bbb R}^n$ be a point. We present a fully polynomial randomized approximation scheme (FPRAS) for computing $\sum_{x \in {\Bbb Z}^n}…
We discuss moments of the Riemann zeta-function in this paper. The purpose of this paper is to give an upper bound of exponential moments of the logarithm of the Riemann zeta-function twisted by arguments. Our results contain an improvement…
Over the last year significant progress was made in the understanding of the computation of Feynman integrals using differential equations. These lectures give a review of these developments, while not assuming any prior knowledge of the…
Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to…
We provide an efficient algorithm for the classical problem, going back to Galton, Pearson, and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples…
In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…
A new method for approximating fractional derivatives of the Gaussian function and Dawson's integral are presented. Unlike previous approaches, which are dominantly based on some discretization of Riemann-Liouville integral using polynomial…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
By giving the definition of the sum of a series indexed by a set on which a group acts, we prove that the sum of the series that defines the Riemann zeta function, the Epstein zeta function, and a few other series indexed by $\Z^k$ has an…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
In our last work, we formulate a Fourier transformation on the infinite-dimensional space of functionals. Here we first calculate the Fourier transformation of infinite-dimensional Gaussian distribution $\exp(-\pi…
A conventional linear model for functional data involves expressing a response variable $Y$ in terms of the explanatory function $X(t)$, via the model: $Y=a+\int_I b(t)X(t)dt+\hbox{error}$, where $a$ is a scalar, $b$ is an unknown function…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
Particular solutions of the Poisson equation can be constructed via Newtonian potentials, integrals involving the corresponding Green's function which in two-dimensions has a logarithmic singularity. The singularity represents a significant…