We establish a construction of single-valued elliptic polylogarithms on elliptic curves, suggesting new mathematical insights.
We establish a general construction of single-valued elliptic polylogarithms as functions on the once-punctured elliptic curve. Our formalism is an extension of Brown’s construction of genus-zero single-valued polylogarithms to the elliptic curve: the condition of trivial monodromy for solutions to the Knizhnik–Zamolodchikov–Bernard equation is expressed in terms of elliptic associators and involves two representations of a two-letter alphabet. Our elliptic single-valued condition reduces to Brown’s genus-zero condition upon degeneration of the torus. We provide several examples for our construction, including the elliptic Bloch–Wigner dilogarithm.
No takes yet. Share an insight, caveat, or question.
Baune et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: