Multiple polylogarithms and the Steinberg module
Steven Charlton, Danylo Radchenko, Daniil Rudenko

TL;DR
This paper links multiple polylogarithms on a torus to the Steinberg module, providing new insights into their structure, duality, and related conjectures, with implications for understanding their algebraic and geometric properties.
Contribution
It establishes a novel connection between multiple polylogarithms and the Steinberg module, offering a unified expression and new proofs of existing theorems.
Findings
Expressed multiple polylogarithms via a single function $ ext{Li}_{n-d+1,1,\
Provided a simple proof of the Bykovski theorem.
Offered a polylogarithmic interpretation of conjectures by Rognes and Church-Farb-Putman.
Abstract
We establish a connection between multiple polylogarithms on a torus and the Steinberg module of , and show that multiple polylogarithms of depth and weight can be expressed via a single function . Using this connection, we give a simple proof of the Bykovski\u{\i} theorem, explain the duality between multiple polylogarithms and iterated integrals, and provide a polylogarithmic interpretation of the conjectures of Rognes and Church-Farb-Putman.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
