Related papers: A review of Dan's reduction method for multiple po…
We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…
The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…
After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden leading coefficient which are thus impractical. To reduce the…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\|\ge 3\log_3 n$ for all $n$. Based on this, this…
For loop integrals, the standard method is reduction. A well-known reduction method for one-loop integrals is the Passarino-Veltman reduction. Inspired by the recent paper [1] where the tadpole reduction coefficients have been solved, in…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
We survey various results and conjectures concerning multiple polylogarithms and the multiple zeta function. Among the results, we announce our resolution of several conjectures on multiple zeta values. We also provide a new integral…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…
In this paper we shall define the analytic continuation of the multiple polylogarithms by using Chen's theory of iterated path integrals and compute the monodromy of all multiple logarithms explicitly.
After a brief general introduction about the integrand-reduction method, we will review the main features of the GoSam 2.0 automated framework for one-loop calculations and illustrate its application to SM processes involving the production…
For an irreducible module $P$ over the Weyl algebra $\mathcal{K}_n^+$ (resp. $\mathcal{K}_n$) and an irreducible module $M$ over the general liner Lie algebra $\mathfrak{gl}_n$, using Shen's monomorphism, we make $P\otimes M$ into a module…
We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…
We review a method for the algebraic treatment of a family of functions which contains the multiple polylogarithms, with applications to the symbolic calculation of Feynman integrals.
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We present an efficient method to shorten the analytic integration-by-parts (IBP) reduction coefficients of multi-loop Feynman integrals. For our approach, we develop an improved version of Leinartas' multivariate partial fraction…
We develop a polynomial reduction procedure that transforms any gauge fixed CHY amplitude integrand for $n$ scattering particles into a $\sigma$-moduli multivariate polynomial of what we call the $\textit{standard form}$. We show that a…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…