2019
DOI: 10.48550/arxiv.1909.13869
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Explicit formulas for Grassmannian polylogarithms

Abstract: We give a new explicit formula for Grassmannian polylogarithms in terms of iterated integrals. We also explicitly reduce the Grassmannian polylogarithm in weight 4 and in weight 5 each to depth 2. Furthermore, using this reduction in weight 4 we obtain an explicit, albeit complicated, form of the so-called 4-ratio, which gives an expression for the Borel class in continuous cohomology of GL 4 in terms of Li 4 .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…This result is sharp as it is easy to show using a coproduct (discussed in §2.1) that a general multiple polylogarithm of weight n can not be expressed via multiple polylogarithms of depth strictly less than tn{2u . The previous best-known result states that a polylogarithm of depth n can be expressed via polylogarithms of depth at most n ´2; see [Cha17], [CGR19b], and [CGR19a] for further results on the depth reduction problem for multiple polylogarithms.…”
mentioning
confidence: 99%
“…This result is sharp as it is easy to show using a coproduct (discussed in §2.1) that a general multiple polylogarithm of weight n can not be expressed via multiple polylogarithms of depth strictly less than tn{2u . The previous best-known result states that a polylogarithm of depth n can be expressed via polylogarithms of depth at most n ´2; see [Cha17], [CGR19b], and [CGR19a] for further results on the depth reduction problem for multiple polylogarithms.…”
mentioning
confidence: 99%