Related papers: PolyLogTools - Polylogs for the masses
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
We investigate several Hopf algebras of diagrams related to Quantum Field Theory of Partitions and whose product comes from the Hopf algebras WSym or WQSym respectively built on integer set partitions and set compositions. Bases of these…
In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x1,x2,...,xn over the field F. We obtain the following result Given a noncommutative…
One of the greatest efforts of computational scientists is to translate the mathematical model describing a class of physical phenomena into large and complex codes. Many of these codes face the difficulty of implementing the mathematical…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…
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…
In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…
We address the problem of evaluation of multiloop Feynman integrals by means of their Mellin-Barnes representation. After a brief overview of available capabilities though open source toolkits and their application in various circumstances,…
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
The symbol bootstrap has proven to be a powerful tool for calculating polylogarithmic Feynman integrals and scattering amplitudes. In this letter, we initiate the symbol bootstrap for elliptic Feynman integrals. Concretely, we bootstrap the…
We employ the recently discovered Hopf algebra structure underlying perturbative Quantum Field Theory to derive iterated integral representations for Feynman diagrams. We give two applications: to massless Yukawa theory and quantum…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
In this paper, we consider measurings between Hopf algebroids and show that they induce morphisms on cyclic homology and cyclic cohomology. We also consider comodule measurings between SAYD modules over Hopf algebroids. These give an…
Cyclic cohomology has been recently adapted to the treatment of Hopf symmetry in noncommutative geometry. The resulting theory of characteristic classes for Hopf algebras and their actions on algebras allows to expand the range of…
In this paper, we present a novel variation of the coded matrix multiplication problem which we refer to as fully private grouped matrix multiplication (FPGMM). In FPGMM, a master wants to compute a group of matrix products between two…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
In this work, we systematically analyse Feynman integrals in the `t Hooft-Veltman scheme. We write an explicit reduction resulting from partial fractioning the high-multiplicity integrands to a finite basis of topologies at any given loop…