Shuffle product of finite multiple polylogarithms
Number Theory
2015-02-25 v1
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.
Keywords
Cite
@article{arxiv.1502.06693,
title = {Shuffle product of finite multiple polylogarithms},
author = {Masataka Ono and Shuji Yamamoto},
journal= {arXiv preprint arXiv:1502.06693},
year = {2015}
}
Comments
13 pages