2 citations · 2 across the 3 of their papers we have counts for
6 papers
On the Goncharov Depth Conjecture and polylogarithms of depth two
Steven Charlton, Herbert Gangl, Danylo Radchenko +1
We prove the surjectivity part of Goncharov's depth conjecture. We also show that the depth conjecture implies that multiple polylogarithms of depth and weight can be expre…
Functional equations of polygonal type for multiple polylogarithms in weights 5, 6 and 7
Steven Charlton, Herbert Gangl, Danylo Radchenko
We present new functional equations in weights 5, 6 and 7 and use them for explicit depth reduction of multiple polylogarithms. These identities generalize the crucial identity $\m…
Generalized Jacobi-Trudi determinants and evaluations of Schur multiple zeta values
Henrik Bachmann, Steven Charlton
We present new determinant expressions for regularized Schur multiple zeta values. These generalize the known Jacobi-Trudi formulae and can be used to quickly evaluate certain type…
On functional equations for Nielsen polylogarithms
Steven Charlton, Herbert Gangl, Danylo Radchenko
We derive new functional equations for Nielsen polylogarithms. We show that, when viewed modulo and products of lower weight functions, the weight Nielsen polyl…
Analogues of cyclic insertion type identities for multiple zeta star values
Steven Charlton
We prove an identity for multiple zeta star values, which generalises some identities due to Imatomi, Tanaka, Tasaka and Wakabayashi. This identity gives an analogue of cyclic inse…
A review of Dan's reduction method for multiple polylogarithms
Steven Charlton
In this paper we will give an account of Dan's reduction method for reducing the weight multiple logarithm to an explicit sum of l…