Related papers: Multiple polylogarithms, a regularisation process …
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
We present a program for the numerical evaluation of multi-dimensional polynomial parameter integrals. Singularities regulated by dimensional regularisation are extracted using iterated sector decomposition. The program evaluates the…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
Closure problems are omnipresent when simulating multiscale systems, where some quantities and processes cannot be fully prescribed despite their effects on the simulation's accuracy. Recently, scientific machine learning approaches have…
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
In this work, we use the theory of error bounds to study metric regularity of the sum of two multifunctions, as well as some important properties of variational systems. We use an approach based on the metric regularity of epigraphical…
The Poincare series of a multi-index filtration on the ring of germs of functions can be written as a certain integral with respect to the Euler characteristic over the projectivization of the ring. Here this integral is considered with…
We extend the definition and construct several bases for polylogarithms Li T , where T are some series, recognizable by a finite state (multiplicity) automaton of alphabet 4 X = {x 0 , x 1 }. The kernel of this new "polylogarithmic map" Li…
Our aim is to explain instances in which the value of the logarithmic Mahler measure of a polynomial can be written in an unexpectedly neat manner. To this end we examine polynomials defining rational curves, which allows their zero-locus…
We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst-Zagier formula. Other results we provide settle…
We introduce and solve an infinite class of loop integrals which generalises the well-known ladder series. The integrals are described in terms of single-valued polylogarithmic functions which satisfy certain differential equations. The…
This article consists to give a necessary and sufficient condition of the meromorphic continuity of Dirichlet series defined as $\sum_{x\in \mathbf{N}^n} \frac{a_{x}}{P(x)^s}$, Where $a_{x}$ is a $q$-automatic sequence of $n$ parameters and…
When are two germs of analytic systems conjugate or orbitally equivalent under an analytic change of coordinates in the neighborhood of a singular point? A way to answer is to use normal forms. But there are large classes of dynamical…
The Pauli--Villars regularization procedure confirms and sharpens the conclusions reached previously by covariant point splitting. The divergences in the stress tensor of a quantized scalar field interacting with a static scalar potential…
The purpose of this paper is to study holomorphic approximation and approximation of $\bar\partial$-closed forms in complex manifolds of complex dimension $n\geq 1$. We consider extensions of the classical Runge theorem and the Mergelyan…
Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well-known problems can be cast as promise CSPs including approximate graph…
We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…
A function of a matrix is polyconvex when it can be expressed as a convex function of the matrix minors. Polyconvexity is a regularity condition ensuring existence of minimizers in nonlinear elasticity and, more broadly, in vectorial…
We establish Multilayer Correlation Clustering, a novel generalization of Correlation Clustering to the multilayer setting. In this model, we are given a series of inputs of Correlation Clustering (called layers) over the common set $V$ of…