Resumen de A reduction formulafor length-two polylogarithms and some applications

Matilde N. Lalín, Jean Sébastien Lechasseur

• We use shuffle and stuffle relations to give a simple proof of a reduction formula for length-two multiple polylogarithms evaluated in complex parameters of absolute value 1 in terms of a finite sum of products of lengthone polylogarithms. This result was originally due to Nakamura and recently reproved by Panzer by different methods. This generalises results of Borwein and Girgensohn for alternating Euler sums and for multiple zeta values twisted by fourth roots of unity by the first author. We also explore implications for other colored multiple zeta values and present some applications to Mahler measure and Feynman diagrams.