2000 character limit reached
An Elliptic Generalization of Multiple Polylogarithms
Published 11 Sep 2017 in hep-ph and hep-th | (1709.03622v2)
Abstract: We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise graph. Building upon the well known properties of multiple polylogarithms, we associate a concept of weight to these functions and show that this weight can be lowered by the action of a suitable differential operator. We then show how properties and relations among these functions can be studied bottom-up starting from lower weights.
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.