arXiv · 1502.06693
Shuffle product of finite multiple polylogarithms
Abstract
In this paper, we define a finite sum analogue of multiple polylogarithms inspired by the work of Kaneko and Zaiger and prove that they satisfy a certain analogue of the shuffle relation. Our result is obtained by using a certain partial fraction decomposition due to Komori-Matsumoto-Tsumura. As a corollary, we give an algebraic interpretation of our shuffle product.
Explore related subjects
Keep this discovery
Masataka Ono, Shuji Yamamoto. 2015-02-24. Shuffle product of finite multiple polylogarithms. https://arxiv.org/abs/1502.06693
Cite the original work for its findings. Save a collection to share your selection of sources.