From polygons and symbols to polylogarithmic functions

By Claude Duhr, Herbert Gangl, John R. Rhodes. 2011

341 citations recorded by the source corpus.

A bstractWe present a review of the symbol map, a mathematical tool introduced by Goncharov and used by him and collaborators in the context of $ \mathcal{N} $ = 4 SYM for simplifying expressions among multiple polylogarithms, and we recall its main properties. A recipe is given for how to obtain the symbol of a multiple polylogarithm in terms of the combinatorial properties of an associated rooted decorated polygon, and it is indicated how that recipe relates to a similar explicit formula for it previously given by Goncharov. We also outline a systematic approach to constructing a function corresponding to a given symbol, and illustrate it in the particular case of harmonic polylogarithms up to weight four. Furthermore, part of the ambiguity of this process is highlighted by exhibiting a family of non-trivial elements in the kernel of the symbol map for arbitrary weight.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/7592fde349bd19a908f2887937be4f207067e690

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Claude Duhr
  2. L. Dixon
  3. J. Henn
  4. Jeffrey Pennington
  5. S. Stieberger
  6. O. Schlotterer
  7. Johannes Broedel
  8. J. Drummond

In Discrete Mathematics and Combinatorics

  1. Claude Duhr
  2. L. Dixon
  3. Jeffrey Pennington
  4. H. Johansson
  5. S. Stieberger
  6. Alexander Ochirov
  7. O. Schlotterer
  8. Johannes Broedel

In Geometry and Topology

  1. Claude Duhr
  2. S. Stieberger
  3. L. Dixon
  4. O. Schlotterer
  5. Johannes Broedel
  6. Jeffrey Pennington
  7. M. Hippel
  8. J. Drummond

Citations in the corpus