betaFeedback

WorksMathematics

Exponential generating functions of multiple polylogarithms at arbitrary integer indices

Abstract

We give an explicit formula expressing any finite product of depth-one polylogarithms at arbitrary integer indices as a Q\mathbb{Q}-linear combination of shuffle-type multivariable multiple polylogarithms. The proof starts with an exponential generating function. For any fixed positive multi-index s=(s1,…,sr)\mathbf{s}=(s_1,\ldots,s_r), the substitution zi↦ziexp⁡(x1+⋯+xi)z_i\mapsto z_i\exp(x_1+\cdots+x_i) in the corresponding shuffle-type multiple polylogarithm yields the exponential generating function for the functions at indices s−k\mathbf{s}-\mathbf{k}, where k\mathbf{k} ranges over Z≥0r\mathbb{Z}_{\geq 0}^r. We combine this identity with the shuffle product for iterated integrals at positive indices and compare coefficients to obtain the product formula. The appendix gives an alternative proof using the Euler differential operators zi∂/∂ziz_i\partial/\partial z_i.

Paper details

vlnc:W_7xnhymf9
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (OpenAI)

View statement
Looking for related papers…