2000 character limit reached
Finite multiple zeta values associated with 2-colored rooted trees (1609.09168v1)
Published 29 Sep 2016 in math.NT
Abstract: We define finite multiple zeta values (FMZVs) associated with some combinatorial objects, which we call 2-colored rooted trees, and prove that FMZVs associated with 2-colored rooted trees satisfying certain mild assumptions can be written explicitly as $\mathbb{Z}$-linear combinations of the usual FMZVs. Our result can be regarded as a generalization of Kamano's recent work on finite Mordell-Tornheim multiple zeta values. As an application, we will give a new proof of the shuffle relation of FMZVs, which was first proved by Kaneko and Zagier.
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.