Related papers: From polygons and symbols to polylogarithmic funct…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…
The aim of this work is to show how symbolic computation can be used to perform multivariate Lagrange, Hermite and Birkhoff interpolation and help us to build more realistic interpolating functions. After a theoretical introduction in which…
We prove a characterization of the dual mixed volume in terms of functional properties of the polynomial associated to it. To do this, we use tools from the theory of multilinear operators on spaces of continuos functions. Along the way we…
Numerous examples of functional relations for multiple polylogarithms are known. For elliptic polylogarithms, however, tools for the exploration of functional relations are available, but only very few relations are identified. Starting…
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…
This paper investigates the symbolic powers of toric ideals. We first describe them in terms of the kernel of certain linear maps derived from the lattice structure of the toric ideal. Furthermore, we apply our results to show that symbolic…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
In this paper, we review the theory of time space-harmonic polynomials developed by using a symbolic device known in the literature as the classical umbral calculus. The advantage of this symbolic tool is twofold. First a moment…
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space $x$ and frequency $\xi$. The symbol smoothness conditions obeyed by many…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
A symbolic method is used to establish some properties of the Bernoulli-Barnes polynomials.
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
This paper describes generalized polylogarithms, multiple polylogarithms, and multiple zeta values, along with their implementation in Maple 2018. This set of related functions is of interest in high energy physics as well as in number…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
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…
The success of machine learning algorithms is inherently related to the extraction of meaningful features, as they play a pivotal role in the performance of these algorithms. Central to this challenge is the quality of data representation.…