• Corpus ID: 203594080

# Explicit formulas for Grassmannian polylogarithms

@article{Charlton2019ExplicitFF,
title={Explicit formulas for Grassmannian polylogarithms},
author={Steven Charlton and Herbert Gangl and Danylo V. Radchenko},
journal={arXiv: Number Theory},
year={2019}
}
• Published 30 September 2019
• Mathematics
• arXiv: Number Theory
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 $\mathrm{GL}_4$ in terms of $\mathrm{Li}_4$.
2 Citations

### Clean Single-Valued Polylogarithms

• Mathematics, Computer Science
Symmetry, Integrability and Geometry: Methods and Applications
• 2021
We define a variant of real-analytic polylogarithms that are single-valued and that satisfy ''clean'' functional relations that do not involve any products of lower weight functions. We discuss the

### On the Goncharov depth conjecture and a formula for volumes of orthoschemes

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this

## References

SHOWING 1-10 OF 38 REFERENCES

### Applications of the dilogarithm function in algebraic K-theory and algebraic geometry

• Proc. of the International Symp. on Alg. Geometry, Kinokuniya, Tokyo
• 1978

### Identities arising from coproducts on multiple zeta values and multiple polylogarithms

In this thesis we explore identities which can be proven on multiple zeta values using the derivation operators $D_r$ from Brown's motivic MZV framework. We then explore identities which occur on

### On the Goncharov depth conjecture and a formula for volumes of orthoschemes

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this

### On functional equations for Nielsen polylogarithms

• Mathematics
Communications in Number Theory and Physics
• 2021
We derive new functional equations for Nielsen polylogarithms. We show that, when viewed modulo $\mathrm{Li}_5$ and products of lower weight functions, the weight $5$ Nielsen polylogarithm $S_{3,2}$