Related papers: From polygons and symbols to polylogarithmic funct…
The Thom-Boardman symbol was first introduced by Thom in 1956 to classify singularities of differentiable maps. It was later generalized by Boardman to a more general setting. Although the Thom-Boardman symbol is realized by a sequence of…
We define a new homology theory we call symbol homology by using decorated moduli spaces of Whitney polygons. By decorating different types of moduli spaces we obtain different flavors of this homology theory together with morphisms between…
We describe a Maple package that serves at least four purposes. First, one can use it to compute whether or not a given polyhedral structure is Zometool constructible. Second, one can use it to manipulate Zometool objects, for example to…
We give expressions for all generalized polylogarithms up to weight four in terms of the functions log, $\text{Li}_n$, and $\text{Li}_{2,2}$, valid for arbitrary complex variables. Furthermore we provide algorithms for manipulation and…
The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Such sums appear, for instance, in the expansion of Gauss hypergeometric functions around integer indices that depend on a symbolic parameter.…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
In these lectures we discuss some of the mathematical structures that appear when computing multi-loop Feynman integrals. We focus on a specific class of special functions, the so-called multiple polylogarithms, and discuss introduce their…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
Despite significant progress in the development of neural-symbolic frameworks, the question of how to integrate a neural and a symbolic system in a \emph{compositional} manner remains open. Our work seeks to fill this gap by treating these…
In this talk I review the connections between Feynman integrals and multiple polylogarithms. After an introductory section on loop integrals I discuss the Mellin-Barnes transformation and shuffle algebras. In a subsequent section multiple…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
Machine-assisted theorem proving refers to the process of conducting structured reasoning to automatically generate proofs for mathematical theorems. Recently, there has been a surge of interest in using machine learning models in…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
In this review, we present some advanced algorithms and programs used in our scientific school with short description of types of astrophysical systems, which we study. However, we discuss mainly mathematical methods, which may be applied…
The aim of this work is to derive a symbol calculus on $L^2(\mathbb{R}^n)$ for multidimensional Hausdorff operators. Two aspects of this activity result in two almost independent parts. While throughout the perturbation matrices are…