Related papers: From polygons and symbols to polylogarithmic funct…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
We propose a novel method to determine the structure of symbols for any family of polylogarithmic Feynman integrals. Using the d log-bases and simple formulas for the leading order and next-to-leading contributions to the intersection…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…
We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E in R^n. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E^{min} of E where…
We use a result on mixed Tate motives due to Goncharov (arXiv:alg-geom/9601021) to show that the symbol of an arbitrary one-loop 2m-gon integral in 2m dimensions may be read off directly from its Feynman parameterization. The algorithm…
A \emph{Mathematica} Notebook is presented which allows for the transfer or any kind of polynomial expression to \emph{Matlab}. The output is formatted in such a way that \emph{Matlab} routines such as "Root" can be readily implemented.…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
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…
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 consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We discuss an extension of Toeplitz quantization based on polyanalytic functions. We derive isomorphism theorem for polyanalytic Toeplitz operators between weighted Sobolev-Fock spaces of polyanalytic functions, which are images of…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…
We consider the problem of finding the set of classical polylogarithmic functions $\text{Li}_n$ with branching locus determined by the solution of $p_1\cdot p_2\cdot \ldots \cdot p_n=0$, where $p_1,\ldots, p_n$ are irreducible polynomials…
Fourier integral operators with complex phase function are an important tool in the analysis of partial differential equations. The present paper focus on the principal symbol of Lagrangian distributions with complex phase. We provide an…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…