Related papers: CHAPLIN - Complex Harmonic Polylogarithms in Fortr…
In this paper, we present an implementation of the harmonic polylogarithm of Remiddi and Vermaseren for Mathematica. It contains an implementation of the product algebra, the derivative properties, series expansion and numerical evaluation.…
This document is the manual for a free Mathematica package for computing with harmonic functions. This package allows the user to make calculations that would take a prohibitive amount of time if done without a computer. For example, the…
We give new explicit formulas for Grassmannian and Aomoto polylogarithms in terms of iterated integrals, for arbitrary weight. We also explicitly reduce the Grassmannian polylogarithm in weight 4 and in weight 5 each to depth 2.…
The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…
In even-dimensional Euclidean space for integer powers of the Laplacian greater than or equal to the dimension divided by two, a fundamental solution for the polyharmonic equation has logarithmic behavior. We give two approaches for…
A generalization of a recently introduced recursive numerical method for the exact evaluation of integrals of regular solid harmonics and their normal derivatives over simplex elements in $\mathbb{R}^3$ is presented. The original Quadrature…
The authors present SHarmonic, a new implementation of the spherical harmonics targeted for electronic-structure calculations. Their approach is to use explicit formulas for the harmonics written in terms of normalized Cartesian…
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…
In this paper, we begin by reviewing the calculus induced by the framework of [10]. In there, we extended Polylogarithm functions over a subalgebra of noncommutative rational power series, recognizable by finite state (multiplicity)…
We present a simple representation for analytically continued nested harmonic sums for the arbitrary complex argument. This representation can be obtained for a wide range of nested harmonic sums from a precomputed database for the pole…
In this work we present the computer algebra package HarmonicSums and its theoretical background for the manipulation of harmonic sums and some related quantities as for example Euler-Zagier sums and harmonic polylogarithms. Harmonic sums…
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…
In this article, a novel method to compute all discrete polyharmonic functions in the quarter plane for models with small steps, zero drift and a finite group is proposed. A similar method is then introduced for continuous polyharmonic…
The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
A method for the evaluation of the epsilon expansion of multi-loop massless Feynman integrals is introduced. This method is based on the Gegenbauer polynomial technique and the expansion of the Gamma function in terms of harmonic sums.…
The library \emph{fast\_polynomial} for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as H\"orner, divide and conquer and new ones can be added easily. Notably, a new…
Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development. We present Qualtran, an…
We develop a new approach to the study of the functional equations satisfied by classical polylogarithms, inspired by Goncharov's conjectures. We prove a sharpened version of Zagier's criterion for such an equation and explain, how our…
In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…