Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.