Shuffle product of finite multiple polylogarithms

Masataka Ono, Shuji Yamamoto

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In this paper, we define a finite sum analogue of multiple polylogarithms inspired by the work of Kaneko and Zagier (in the article “Finite multiple zeta values” in preparation) and prove that they satisfy a certain analogue of the shuffle relation. Our result is obtained by using a certain partial fraction decomposition which is an idea due to Komori et al. (Math Z 268:993–1011, 2011). As a corollary, we give an algebraic interpretation of our shuffle product.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalManuscripta Mathematica
Publication statusAccepted/In press - 2016 May 30

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Shuffle product of finite multiple polylogarithms'. Together they form a unique fingerprint.

Cite this