Related papers: A Novel Algorithm for Nested Summation and Hyperge…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
The objective of the paper is the study of Mneimneh-like sums with a parametric variant of the multiple harmonic-star values. We generalize and resolve the Pan-Xu conjecture on generalized Mneimneh-like sums and present their…
We tackle the problem of efficiently approximating the volume of convex polytopes, when these are given in three different representations: H-polytopes, which have been studied extensively, V-polytopes, and zonotopes (Z-polytopes). We…
Creative telescoping is an algorithmic method initiated by Zeilberger to compute definite sums by synthesizing summands that telescope, called certificates. We describe a creative telescoping algorithm that computes telescopers for definite…
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…
We present an implementation of algorithms for the symbolic integration of hyperlogarithms multiplied by rational functions in the computer algebra system FORM. This implementation encompasses cases where hyperlogarithms have rational…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
Recasting the $N$-point one loop scalar integral as a probabilistic problem, allows the derivation of integral recurrence relations as well as exact analytical expressions in the most common cases. $\epsilon$ expansions are derived by…
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…
We calculate some finite and infinite sums containing the digamma function in closed-form. For this purpose, we differentiate selected reduction formulas of the hypergeometric function with respect to the parameters applying some derivative…
Recent progress in analytical calculation of the multiple [inverse, binomial, harmonic] sums, related with epsilon-expansion of the hypergeometric function of one variable are discussed.
We extend Petkov\v{s}ek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $\tau(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $\tau$ is the shift operator. Hypergeometric…
We principally present reductions of certain generalized hypergeometric functions $_3F_2(\pm 1)$ in terms of products of elementary functions. Most of these results have been known for some time, but one of the methods, wherein we…
We prove and generalize several recent conjectures of Z.-W. Sun surrounding binomial coefficients and harmonic numbers. We show that Sun's series and their analogs can be represented as cyclotomic multiple zeta values of levels…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
We prove a pair of transformation formulas for multivariate elliptic hypergeometric sum/integrals associated to the $A_n$ and $BC_n$ root systems, generalising the formulas previously obtained by Rains. The sum/integrals are expressed in…
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
A typical formula of multiple zeta values is the sum formula which expresses a Riemann zeta value as a sum of all multiple zeta values of fixed weight and depth. Recently weighted sum formulas, which are weighted analogues of the sum…