Related papers: Evaluating Multiple Polylogarithm Values at Sixth …
For any positive integer $N$ let $\mu_N$ be the group of the $N$th roots of unity. In this note we shall study the $\Q$-linear relations among values of multiple polylogarithms evaluated at $\mmu_N$. We show that the standard relations…
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
Let $N$ be a positive integer. In this paper we shall study the special values of multiple polylogarithms at $N$th roots of unity, called multiple polylogarithm values (MPVs) of level $N$. These objects are generalizations of multiple zeta…
We study generalized log-sine integrals at special values. At $\pi$ and multiples thereof explicit evaluations are obtained in terms of Nielsen polylogarithms at $\pm1$. For general arguments we present algorithmic evaluations involving…
By introducing a generalized notion of multiple zeta values associated with an arbitrary finite subset $S\subset \mathbb{P}^1(\mathbb{C})$ and studying their transformation properties under rational functions, we show that multiple…
Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
In this paper we present a new family of identities for Euler sums and integrals of polylogarithms by using the methods of generating function and integral representations of series. Then we apply it to obtain the closed forms of all…
We evaluate the three-loop massive vacuum bubble diagrams in terms of polylogarithms up to weight six. We also construct the basis of irrational constants being harmonic polylgarithms of arguments $e^{k i \pi/3}$.
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
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…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
We present the FORTRAN-code HPOLY.f for the numerical calculation of harmonic polylogarithms up to w = 8 at an absolute accuracy of $\sim 4.9 \cdot 10^{-15}$ or better. Using algebraic and argument relations the numerical representation can…
The paper deals with weighted spaces $L_p^w(G)$ on a locally compact group G. If w is a positive measurable function on G then we define the space $L_p^w(G)$, $p\ge1$, as $L_p^w(G)=\{f:fw\in L_p(G)\}$. We consider weights such that these…
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…
I define multiple Watson values (MWVs) as iterated integrals, on the interval $x\in[0,1]$, of the 6 differential forms $A=d\log(x)$, $B=-d\log(1-x)$, $T=-d\log(1-z_1x)$, $U=-d\log(1-z_2x)$, $V=-d\log(1-z_3x)$ and $W=-d\log(1-z_4x)$, where…
This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
We evaluate analytically the one-loop one-mass hexagon in six dimensions. The result is given in terms of standard polylogarithms of uniform transcendental weight three.