Related papers: PolyLogTools - Polylogs for the masses
In this note we discuss the possibility of constructing the cosimplicial complex for the multiplier Hopf algebras and extending the cyclicity operator to obtain the Hopf-cyclic cohomology for them. We show that the definition of modular…
Flip graphs were recently introduced in order to discover new matrix multiplication methods for matrix sizes. The technique applies to other tensors as well. In this paper, we explore how it performs for polynomial multiplication.
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We…
We develop the theory of multiple polylogarithms from analytic, Hodge and motivic point of view. Define the category of mixed Tate motives over a ring of integers in a number field. Describe explicitly the multiple polylogarithm Hopf…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
Polylab is a MATLAB toolbox for multivariate polynomial scalars and polynomial matrices with a unified symbolic-numeric interface across CPU and GPU-oriented backends. The software exposes three aligned classes: MPOLY for CPU execution,…
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra…
We define motivic iterated integrals on the affine line, and give a simple proof of the formula for the coproduct in the Hopf algebra of they make. We show that it encodes the group law in the automorphism group of certain non-commutative…
We initiate a systematic framework for the analysis of analytic properties of finite Feynman integrals that are multiple polylogarithms. Based on the Feynman parameter representation in complex projective space, we make a complete…
It was observed that hyperlogarithms provide a tool to carry out Feynman integrals. So far, this method has been applied successfully to finite single-scale processes. However, it can be employed in more general situations. We give examples…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
We present the Mathematica package $\texttt{MultiHypExp}$ that allows for the expansion of multivariate hypergeometric functions (MHFs), especially those likely to appear as solutions of multi-loop, multi-scale Feynman integrals, in the…
We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
We analyze a general family of fibrations which, after looping, have sections. Methods are developed to determine the homotopy type of the fibre and the homotopy classes of the map from the fibre to the base. The methods are driven by…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of 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…
In modern quantum field theory, one of the most important tasks is the calculation of loop integrals. Loop integrals appear when evaluating the Feynman diagrams with one or more loops by integrating over the internal momenta. Even though…