Related papers: CHAPLIN - Complex Harmonic Polylogarithms in Fortr…
Harmonic polylogarithms $\H(\vec{a};x)$, a generalization of Nielsen's polylogarithms ${S}_{n,p}(x)$, appear frequently in analytic calculations of radiative corrections in quantum field theory. We present an algorithm for the numerical…
We present the FORTRAN-code HPOLY.f for the numerical calculation of harmonic polylogarithms up to w = 8 at an absolute accuracy of $\sim 4.9 \cdot 10^{-15}$ or better. Using algebraic and argument relations the numerical representation can…
The two-dimensional harmonic polylogarithms $\G(\vec{a}(z);y)$, a generalization of the harmonic polylogarithms, themselves a generalization of Nielsen's polylogarithms, appear in analytic calculations of multi-loop radiative corrections in…
Generalised polylogarithms naturally appear in higher-order calculations of quantum field theories. We present handyG, a Fortran 90 library for the evaluation of such functions, by implementing the algorithm proposed by Vollinga and…
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for…
We give expressions for all generalized polylogarithms up to weight four in terms of the functions log, $\text{Li}_n$, and $\text{Li}_{2,2}$, valid for arbitrary complex variables. Furthermore we provide algorithms for manipulation and…
We present a very simple expression and a Fortran code for the fast and precise calculation of three-dimensional harmonic-oscillator transformation brackets. The complete system of symmetries for the brackets along with analytical…
In this paper we describe the extension of the Mathematica package HPL to treat harmonic polylogarithms of complex arguments. The harmonic polylogarithms have been introduced by Remiddi and Vermaseren and have many applications in high…
We describe how to compute numerically in the complex plain a set of Generalized Harmonic Polylogarithms (GHPLs) with square roots in the weights, using the C++/GiNaC numerical routines of Vollinga and Weinzierl. As an example, we provide…
We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and recall its main properties. A recipe is given for how to obtain the symbol of a multiple…
The harmonic polylogarithms (hpl's) are introduced. They are a generalization of Nielsen's polylogarithms, satisfying a product algebra (the product of two hpl's is in turn a combination of hpl's) and forming a set closed under the…
We show some of the mathematics that is being developed for the computation of deep inelastic structure functions to three loops. These include harmonic sums, harmonic polylogarithms and a class of difference equations that can be solved…
This paper develops an approach to the evaluation of quadratic Euler sums that involve harmonic numbers. The approach is based on simple integral computations of polyloga- rithms. By using the approach, we establish some relations between…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
We consider the reflection identities for harmonic sums at weight four. We decompose a product of two harmonic sums with mixed pole structure into a linear combination of terms each having a pole at either negative or positive values of the…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
Weighing the topological domain over which data can be represented and analysed is a key strategy in many signal processing and machine learning applications, enabling the extraction and exploitation of meaningful data features and their…
I present a lightweight C++ library for the evaluation of classical polylogarithms Li_n and the special function Li_{22} for arbitrary complex arguments. The evaluation is possible in arbitrary precision arithmetic and features also an…
We express a general multiple polylogarithm of weight n as an explicit linear combination of multiple polylogarithms of weight n in n-2 variables. We express a general multiple polylogarithm of weight 4 as an explicit linear combination of…