A discretization of the iterated integral expression of the multiple polylogarithm

Abstract

Recently, Maesaka, Watanabe, and the third author discovered a phenomenon where the iterated integral expressions of multiple zeta values become discretized. In this paper, we extend their result to the case of multiple polylogarithms and provide two proofs. The first proof uses the method of connected sums, while the second employs induction based on the difference equations that discrete multiple polylogarithms satisfy. We also investigate several applications of our main result.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…