Shuffle product of finite multiple polylogarithms
- 143 Downloads
In this paper, we define a finite sum analogue of multiple polylogarithms inspired by the work of Kaneko and Zagier (in the article “Finite multiple zeta values” in preparation) and prove that they satisfy a certain analogue of the shuffle relation. Our result is obtained by using a certain partial fraction decomposition which is an idea due to Komori et al. (Math Z 268:993–1011, 2011). As a corollary, we give an algebraic interpretation of our shuffle product.
Mathematics Subject Classification:Primary 11M32 Secondary 05A19
Unable to display preview. Download preview PDF.
The authors would like to thank the members of the KiPAS-AGNT group for giving us a great environment to study and reading the manuscript carefully, and members of the Department of Mathematics at Keio University for their hospitality. This research was supported in part by JSPS KAKENHI 21674001, 26247004.
- 10.Kontsevich, M.: The 1+1/2 logarithm, appendix to [EG]. Compos. Math. 130, 211–214 (2002)Google Scholar