Related papers: Clean Single-Valued Polylogarithms
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
We derive the structural relations between nested harmonic sums and the corresponding Mellin transforms of Nielsen integrals and harmonic polylogarithms at weight {\sf w = 6}. They emerge in the calculations of massless single--scale…
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…
New theorems characterizing analytically discs in the Euclidean plane $\RR^2$ are proved. Weighted mean value properties of solutions to the modified Helmholtz equation and harmonic functions are used for this purpose. The presence of a…
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…
A method of functional reduction for the dimensionally regularized one-loop Feynman integrals with massive propagators is described in detail. The method is based on a repeated application of the functional relations proposed by the author.…
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.…
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 prove that every smooth closed manifold admits a smooth real-valued function with only two critical values. We call a function of this type a \emph{Reeb function}. We prove that for a Reeb function we can prescribe the set of minima (or…
We prove that the homogeneously polyanalytic functions of total order $m$, defined by the system of equations $\overline{D}^{(k_1,\ldots,k_n)} f=0$ with $k_1+\cdots+k_n=m$, can be written as polynomials of total degree $<m$ in variables…
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…
This paper is a companion paper to [G4], where sharp estimates are proven for Fourier transforms of compactly supported functions built out of two-dimensional real-analytic functions. The theorems of [G4] are stated in a rather general…
In the present paper we extend the multiplicative integral to complex-valued functions of complex variable. The main difficulty in this way, that is the multi-valued nature of the complex logarithm, is avoided by division of the interval of…
In this paper, we investigate the uniqueness property of meromorphic functions together with its linear difference polynomial sharing two sets. Using the polynomial introduced in [FILOMAT 33(18)(2019), 6055-6072], we have improved the…
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for…
This paper presents a simplified method of expressing the solution to cubic equations in terms of function evaluation only. The method eliminates the need to manipulate the original coefficients of the cubic polynomial and makes the…
We introduce the notion of the generalized-analytical function of the poly-number variable, which is a non-trivial generalization of the notion of analytical function of the complex variable and, therefore, may turn out to be fundamental in…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…
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 classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…