Related papers: Classical Polylogarithms
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
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…
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, a new higher Hochschild Complex is defined with an Iterated Integral map to locally model differential forms on the space of bigons on $M$. In particular, given the local data for a gerbe with structure 2-group given by a…
The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…
The phenomenon of a topological monodromy in integrable Hamiltonian and nonholonomic systems is discussed. An efficient method for computing and visualizing the monodromy is developed. The comparative analysis of the topological monodromy…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
In a recent work, the author has constructed two families of algebraic cycles in Bloch cycle algebra over the prjective line minus 3 points that are expected to correspond to multiple polylogarithms in one variable and have a good…
This is a collection of articles, written as sections, on arithmetic properties of differential equations, holomorphic foliations, Gauss-Manin connections and Hodge loci. Each section is independent from the others and it has its own…
The values at positive integers of the polyzeta functions are solutions of the polynomial equations arising from Drinfeld's associators, which have numerous applications in quantum algebra. Considered as iterated integrals they become…
We extend the well known theory of $s$-numbers of linear operators to homogeneous polynomials defined between Banach spaces. Approximation, Kolmogorov and Gelfand numbers of polynomials are introduced and some well-known results of the…
The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method…
In this paper we present a generalization of the classical Hermite polynomials to the framework of Clifford-Dunkl operators. Several basic properties, such as orthogonality relations, recurrence formulae and associated differential…
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…
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…
Explicit solutions of the classical Calogero (rational with/without harmonic confining potential) and Sutherland (trigonometric potential) systems is obtained by diagonalisation of certain matrices of simple time evolution. The method works…
We prove quite general statements about functional equations in any number of variables for the dilogarithms defined by Bloch-Wigner, Rogers, and Coleman, showing that they follow from certain 5-term and 2-term relations in a precise way.…