On the Goncharov Depth Conjecture and polylogarithms of depth two
Reviewed by Pithpith:VLZGY6HXopen to challenge →
classification
math.NT
keywords
depthconjecturedotsgoncharovpolylogarithmsproveexpressedfunction
read the original abstract
We prove the surjectivity part of Goncharov's depth conjecture. We also show that the depth conjecture implies that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function $\mathrm{Li}_{n-d+1,1,\dots,1}(a_1,a_2,\dots,a_d)$, and we prove this latter statement for $d=2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.