TOPICS
Search

Generalized Polylogarithm


The generalized polylogarithm, also called the Goncharov polylogarithm, is an iterated integral defined recursively by

 G(a_1,...,a_k;z)=int_0^z(G(a_2,...,a_k;t))/(t-a_1)dt,

where G(;z)=1. For a list of k zeros, the normalization is

 G(0,...,0_()_(k);z)=((lnz)^k)/(k!).

The integral can initially be taken along a positive real segment that avoids the nonzero a_j. Its other branches are obtained by analytic continuation along paths avoiding 0 and the nonzero a_j (Goncharov 2001). For positive integer s, the ordinary polylogarithm Li_s(z) equals -G(0,...,0_()_(s-1),1;z) for 0<z<1. Restricting the indices to 0, 1, and -1 also gives the harmonic polylogarithm, with a factor of -1 for each index equal to 1.

The generalized polylogarithm is implemented in the Wolfram Language as GeneralizedPolyLog[{a1, ..., ak}, z].


See also

Harmonic Polylogarithm, Iterated Integral, Multidimensional Polylogarithm, Polylogarithm

Explore with Wolfram|Alpha

References

Goncharov, A. B. "Multiple Polylogarithms and Mixed Tate Motives." March 8, 2001. https://arxiv.org/abs/math/0103059.

Cite this as:

Weisstein, Eric W. "Generalized Polylogarithm." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GeneralizedPolylogarithm.html

Subject classifications