Discovering multiple polylogarithm equations via symbolic computations

Abstract

We discuss how symbolic computations can be used to find functional equations for multiple polylogarithms and prove parts of Goncharov's depth conjecture. We present a custom-built C++ toolkit for polylogarithm symbol manipulations in Lie coalgebras and show how this approach compares favorably to the alternatives in terms of performance.