Multiple Polylogarithms: An Introduction
Multiple Polylogarithms: An Introduction
复制标题
多重多对数:简介
DOI:
10.1007/978-93-86279-10-1_1
复制
发表时间:
2002
期刊:
影响因子:
--
通讯作者:
Michel Waldschmidt
中科院分区:
文献类型:
--
作者:
Michel Waldschmidt
Multiple polylogarithms in a single variable are defined by, whens1, … ,skare positive integers andza complex number in the unit disk. Fork= 1, this is the classical polylogarithm Lis(z). These multiple polylogarithms can be defined also in terms of iterated Chen integrals and satisfyshuffle relations. Multiple polylogarithms in several variables are defined forsi≥ 1 and |zi| < 1(1 ≤i≤k) by L i ( s 1 ,⋯, s k ) ( z 1 ,⋯ z k )= ∑ n 1 > n 2 >⋯> n k ≥1 z 1 n 1 ⋯ z k n k n 1 s 1 ⋯ n k s k , and they satisfy not only shuffle relations, but alsostuffle relations. When one specializes the stuffle relations in one variable atz= 1 and the stuffle relations in several variables atz1= ⋯ =zk= 1, one gets linear or quadratic dependence relations between the Multiple Zeta Valueswhich are defined fork,s1, … ,skpositive integers withs1≥ 2.The Main Diophantine Conjecturestates that one obtains in this way all algebraic relations between these MZV.