pith. sign in

arxiv: 1112.0389 · v3 · pith:OZZ62NAMnew · submitted 2011-12-02 · 🧮 math.QA · math.CA· math.NT

The inversion formula of polylogarithms and the Riemann-Hilbert problem

classification 🧮 math.QA math.CAmath.NT
keywords problemriemann-hilbertpolylogarithmszetaadditivearticleconnectionequation
0
0 comments X
read the original abstract

In this article, we set up a method of reconstructing to polylogarithms $\mathrm{Li}_k(z)$ from zeta values $\zeta(k)$ via the Riemann-Hilbert problem. This is referred to as "a recursive Riemann-Hilbert problem of additive type." Moreover, we suggest a framework of interpreting the connection problem of the Knizhnik-Zamolodochikov equation of one variable as a Riemann-Hilbert problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.