Related papers: A C99 Implementation of the Clausen Sums
This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…
This paper summarizes the essential functionality of the computer algebra package HarmonicSums. On the one hand HarmonicSums can work with nested sums such as harmonic sums and their generalizations and on the other hand it can treat…
In this paper, we give a practical method to compute the Jacobian matrices of generalized Chebyshev polynomials associated to arbitrary semisimple Lie algebras. The entries of each Jacobian matrix can be expressed as a linear combination of…
The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
We provide estimates for sums of the form \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\chi(a+b+c)\right|\] and \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\sum_{d\in D}\chi(a+b+cd)\right|\] when $A,B,C,D\subset \mathbb F_p$, the field…
These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…
We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture…
We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…
Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…
We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…
The software package developed in the MS thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations…
Nested binomial sums form a particular class of sums that arise in the context of particle physics computations at higher orders in perturbation theory within QCD and QED, but that are also mathematically relevant, e.g., in combinatorics.…
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…
We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…
Let $x_{1},x_{2},\ldots,x_{n}$ be $n$ numbers, and $y_{1},y_{2},\ldots,y_{n}$ be $n$ further numbers chosen such that all $n^{2}$ pairwise sums $x_{i}+y_{j}$ are nonzero. Consider the $n\times n$-matrix \[ C:=\left(…