Related papers: On the Goncharov Depth Conjecture and polylogarith…

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…

We establish a connection between multiple polylogarithms on a torus and the Steinberg module of $\mathbb{Q}$, and show that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function…

We clarify the relationship between different multiple polylogarithms in weight~4 by writing suitable linear combinations of a given type of iterated integral I_{n_1,...,n_d}(z_1,...,z_d), in depth d>1 and weight \sum_i n_i=4 in terms of…

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…

We prove that the weight 6, depth 3, multiple polylogarithm $ \mathrm{Li}_{4,1,1}((xyz)^{-1}, x, y) $, or rather its more natural `divergent' incarnation $ \mathrm{Li}_{3;1,1,1}(x,y,z) $, satisfies the 6-fold anharmonic symmetries of the…

We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov…

We express a general multiple polylogarithm of weight n as an explicit linear combination of multiple polylogarithms of weight n in n-2 variables. We express a general multiple polylogarithm of weight 4 as an explicit linear combination of…

We present new functional equations in weights 5, 6 and 7 and use them for explicit depth reduction of multiple polylogarithms. These identities generalize the crucial identity $\mathbf{Q}_4$ from the recent work of Goncharov and Rudenko…

We develop a new approach to the study of the functional equations satisfied by classical polylogarithms, inspired by Goncharov's conjectures. We prove a sharpened version of Zagier's criterion for such an equation and explain, how our…

In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.

We continue the study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we show the following results: Theorem A: The multiple…

We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…

We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…

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…

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…

We use Goncharov's coproduct of multiple polylogarithms to define a Lie coalgebra over an arbitrary field. It is generated by symbols subject to inductively defined relations, which we think of as functional relations for multiple…

Let s_1,...,s_d be d positive integers and consider the multiple Hurwitz-zeta value zeta(s_1,...,s_d;-1/2,...,-1/2)/2^w where w=s_1+...+s_d is called the weight. For d<n+1, let T(2n,d) be the sum of all these values with even arguments…

In this paper we will give an account of Dan's reduction method for reducing the weight $ n $ multiple logarithm $ I_{1,1,\ldots,1}(x_1, x_2, \ldots, x_n) $ to an explicit sum of lower depth multiple polylogarithms in $ \leq n - 2 $…

In this short note, we prove Hadwiger's conjecture for strongly monotypic polytopes.