Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables

摘要

We study here the coloured multiple zeta values, obtained by extending the usual notion of the multiple zeta values by adding roots of unity. We state their main combinatorial properties. And we give, as a result, a Maple algorithm which generates the relations table between these values.