[ Homepage | Publications | Talks | TeXmacs |
Mathemagix ] |

Generalized polylogarithms are defined as iterated integrals with
respect to the two differential forms
and . We prove an algorithm
which computes the *monodromy* of these special functions. This
algorithm, implemented in *multiple zeta values*. We prove that the algebra of polylogarithms
is isomorphic to a *shuffle algebra*.

**Authors:**

**Keywords: **polylogarithms, multiple zeta values,
monodromy, Lyndon words

**View:** Gzipped Postscript, BibTeX