Replica Identities arising from coproducts on multiple zeta values and multiple polylogarithms online yard sale

ByElle Pop

Replica Identities arising from coproducts on multiple zeta values and multiple polylogarithms online yard sale

Identities arising from coproducts on multiple zeta values and multiple polylogarithms Charlton, Steven Paul (2016) . Doctoral thesis, Durham University. PDF Accepted Version 2269KbAbstractIn this thesis we explore identities which can be proven on multiple zeta values using the derivation operators from Brown’s motivic MZV framework. We then explore identities which occur on multiple polylogarithms by way of the symbol map, and the multiple polylogarithm coproduct. On multiple zeta values, we consider Borwein, Bradley, Broadhurst, and Lisonk’s cyclic insertion conjecture about inserting blocks of between the arguments of. We generalise this conjecture to a much broader setting, and give a proof of a symmetrisation of this generalised cyclic insertion conjecture. This proof is by way of the block decomposition of iterated integrals introduced here, and Brown’s motivic MZV framework. This symmetrisation allows us to prove (or to make progress towards) various conjectural identities, including the original cyclic insertion conjecture, and Hoffman’s identity. Moreover, we can then generate unlimited new conjectural identities, and give motivic proofs of their symmetrisations. We then consider the task of relating weight 5 multiple polylogarithms. Using the symbol map, we determine all of the symmetries and functional equations between depth 2 and between depth 3 iterated integrals with ‘coupled cross ratio’ arguments. We lift the identity for to an identity holding exactly on the level of the symbol and prove a generalisation of this for. Moreover, we further lift the subfamily to a candidate numerically testable identity using slices of the coproduct. We review Dan’s reduction method for reducing the iterated integral to a sum in variables. We provide proofs for Dan’s claims, and run the method in the case to correct Dan’s original reduction of to and. We can then compare this with another reduction to find functional equations, and their nature. We then give a reduction of to, and, and indicate how one might be able to further reduce to and. Lastly, we use and generalise an idea suggested by Goncharov at weight 4 and weight 5. We find terms when certain, and functional equations are substituted into the arguments of symmetrisations of. By expanding in two different ways we obtain functional equations for and. We make some suggestions for how this might work at weight 7 hermes dog collar replica and weight 8 giving a potential route to and functional equations.

About the author

Elle Pop author

Leave a Reply