论文标题

在Goncharov的深度猜想和深度的细分线上

On the Goncharov Depth Conjecture and polylogarithms of depth two

论文作者

Charlton, Steven, Gangl, Herbert, Radchenko, Danylo, Rudenko, Daniil

论文摘要

我们证明了Goncharov深度猜想的溢流性部分。我们还表明,深度猜想意味着可以通过单个函数$ \ mathrm {li} _ {n-d+1,1,\ dots,1}(a_1,a_1,a_2,a_2,a_2,dots,a_d)$,我们的prove $ d = 2 $ d = 2 = 2 = 2 $ d = 2 $ d = 2 $ d = 2 = 2 = 2 = 2 = 2 $ d = d = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 $ d = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 = 2 =

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$.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源