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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.