2000 character limit reached
Shuffle product of finite multiple polylogarithms
Published 24 Feb 2015 in math.NT | (1502.06693v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.