Related papers: Analytic continuation of multiple polylogarithms

Relations among integrals of logarithms, polylogarithms and Euler sums are presented. A unifying element being the introduction of Nielsen's generalized polylogarithms.

Recently, Maesaka, Watanabe, and the third author discovered a phenomenon where the iterated integral expressions of multiple zeta values become discretized. In this paper, we extend their result to the case of multiple polylogarithms and…

We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…

The Chen series map giving the universal monodromy representation of $\mathbb{P}^1\backslash\{0,1,\infty\}$ is extended to an injective 1-cocycle of $PSL(2, \mathbb{Z})$ into power series with complex coefficients in two non-commuting…

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is…

This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given…

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…

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We introduce a symbolic representation of $r$-fold harmonic sums at negative indices. This representation allows us to recover and extend some recent results by Duchamp et al., such as recurrence relations and generating functions for these…

We present for numerical use the analytic continuations to complex arguments of those basic Mellin transforms, which build the harmonic sums contributing to the 3--loop anomalous dimensions. Eight new basic functions contribute in addition…

A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…

We critique a Pade analytic continuation method whereby a rational polynomial function is fit to a set of input points by means of a single matrix inversion. This procedure is accomplished to an extremely high accuracy using a novel…

Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials…

We propose hypergeometric constructions of simultaneous approximations to polylogarithms. These approximations suit for computing the values of polylogarithms and satisfy 4-term Apery-like (polynomial) recursions.

We introduce the concept of homotopy iterators for performing polynomial homotopy continuation tasks in a memory efficient manner. The main idea is to push forward an iterator for the start solutions of a homotopy via the function which…

In this article, we study the analytic properties of the multiple polylogarithms in the $s$-aspect. Although the domain of absolute convergence of the series defining the multiple polylogarithms is well-known, the study towards a larger…

We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…