Related papers: On the Reduction and Evaluation of Generalized Pol…
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 introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…
In this talk, we discuss recent progress in the application of generalizations of polylogarithms in the symbolic computation of multi-loop integrals. We briefly review the Maple program MPL which supports a certain approach for the…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
This is a copy of the article published in Math Res. Letters 5, (1998) 497-516.
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.
This talk summarizes recent developments in the evaluation of Feynman integrals using hyperlogarithms. We discuss extensions of the original method, new results that were obtained with this approach and point out current problems and future…
This article is based on a talk given at the Ghent Geometric Analysis Seminar in 2023. We review basic notions from the theory of weightings along submanifolds, with special emphasis on multiplicative weightings for Lie groupoids along…
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…
This paper is an introduction to classical polylogarithms and is an expanded version of a talk given by the author at the Motives conference. Topics covered include, monodromy; the polylogarithm local systems; Bloch's constructions of…
In this paper we will give an account of Dan's reduction method for reducing the weight $ n $ multiple logarithm $ I_{1,1,\ldots,1}(x_1, x_2, \ldots, x_n) $ to an explicit sum of lower depth multiple polylogarithms in $ \leq n - 2 $…
The method introduced in a previous paper to simplify the tensorial reduction in multi-leg loop calculations is extended to generic one-loop integrals, with arbitrary internal masses and external momenta.
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
In this lecture note, we give a basic introduction to the rapidly developing concepts of generalized symmetries, from the perspectives of both high energy physics and condensed matter physics. In particular, we emphasize on the (invertible)…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
We develop the theory of generalized bi-Hamiltonian reduction. Applying this theory to a suitable loop algebra we recover a generalized Drinfeld-Sokolov reduction. This gives a way to construct new examples of algebraic Frobenius manifolds.
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
In this paper we review main ideas mentioned in several other papers which talk about optimization techniques used by compilers. Here we focus on loop unrolling technique and its effect on power consumption, energy usage and also its impact…