Related papers: PolyLogTools - Polylogs for the masses
We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…
A long-term research proposal on the algebraic structure, the representations and the possible applications of paraparticle algebras is structured in three modules: The first part stems from an attempt to classify the inequivalent gradings…
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and…
We present a new systematic method for evaluating generalized log-sine integrals in terms of polylogarithms. Our approach is based on an identity connecting ordinary generating functions of polylogarithms to integrals involving the sine…
We establish a connection between multiple polylogarithms on a torus and the Steinberg module of $\mathbb{Q}$, and show that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
We introduce the notion of a strongly homotopy-comultiplicative resolution of a module coalgebra over a chain Hopf algebra, which we apply to proving a comultiplicative enrichment of a well-known theorem of Moore concerning the homology of…
We introduce general q-deformed multiple polylogarithms which even in the dilogarithm case differ slightly from the deformation usually discussed in the literature. The merit of the deformation as suggested, here, is that q-deformed…
In this work, we develop systematically the ``Dirichlet Hopf algebra of arithmetics'' by dualizing addition and multiplication maps. We study the additive and multiplicative antipodal convolutions which fail to give rise to Hopf algebra…
In this note we study logarithmic transformations in the sense of differential topology on two fibers of the Hopf surface. It is known that such transformations are susceptible to yield exotic smooth structures on four-manifolds. We will…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
We present a new methodology, suitable for implementation on computer, to perform the $\epsilon$-expansion of hypergeometric functions with linear $\epsilon$ dependent Pochhammer parameters in any number of variables. Our approach allows…
We identify two families of ten-point Feynman diagrams that generalize the elliptic double box, and show that they can be expressed in terms of the same class of elliptic multiple polylogarithms to all loop orders. Interestingly, one of…
The Hopf algebra structure underlying Feynman diagrams which governs the process of renormalization in perturbative quantum field theory is reviewed. Recent progress is briefly summarized with an emphasis on further directions of research.
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…