Related papers: Algorithms to Evaluate Multiple Sums for Loop Comp…
We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.
In this paper, we introduce 3-dimensional $L-$summing method, which is a rearrangement of the summation $\sum A_{abc}$ with $1\leq a,b,c\leq n$. Applying this method on some special arrays, we obtain some identities on the Riemann zeta…
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…
In this paper, we investigate three general forms of multiple zeta(-star) values. We use these values to give three new sum formulas for multiple zeta(-star) values with height $\leq 2$ and the evaluation of…
We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph $G$ to evaluate to multiple zeta values. The criterion depends…
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…
We give a new expression of the multiple harmonic sum, which serves as a refinement of the iterated integral expression of the multiple zeta value, and prove it using the so-called connected sum method. Based on this fact, by taking two…
The explicit formulas expressing harmonic sums via alternating Euler sums (colored multiple zeta values) are given, and some explicit evaluations are given as applications.
We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…
For $k\leq n$, let $E(mn,k)$ be the sum of all multiple zeta values of depth $k$ and weight $mn$ with arguments are multiples of $m\geq 2$. More precisely, $E(mn,k)=\sum_{|\boldsymbol{\alpha}|=n}\zeta(m\alpha_1,m\alpha_2,\ldots,…
Slowly convergent or divergent sequences and series occur abundantly in quantum physics and quantum chemistry. These convergence problems can be overcome with the help of nonlinear sequence transformations (Wynn's epsilon or rho algorithm,…
In this paper we study restricted sum formulas involving alternating Euler sums which are defined by \zeta(s_1,...,s_{d};\epsilon_1,...,\epsilon_d)=\sum_{n_1>...>n_d\ge 1}\frac{\epsilon_1^{n_1}... \epsilon_{d}^{n_d}}{n_1^{s_1}...…
Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…
By some hypergeometric summation theorems, the authors establish a series of new infinite summation formulas involving generalized harmonic numbers related to Riemann-Zeta function, with three different patterns.
The hyperharmonic numbers h_{n}^{(r)} are defined by means of the classical harmonic numbers. We show that the Euler-type sums with hyperharmonic numbers: {\sigma}(r,m)=\sum_{n=1}^{\infty}((h_{n}^{(r)})/(n^{m})) can be expressed in terms of…
We describe various expansion schemes that can be used to study gravitational clustering. Obtained from the equations of motion or their path-integral formulation, they provide several perturbative expansions that are organized in different…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…