From polygons and symbols to polylogarithmic functions
Oct, 2011
75 pages
Published in:
- JHEP 10 (2012) 075
e-Print:
- 1110.0458 [math-ph]
Report number:
- IPPP-11-56,
- DCPT-11-112
View in:
Citations per year
Abstract: (arXiv)
We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and 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. 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.Note:
- 75 pages. Mathematica files with the expression of all HPLs up to weight 4 in terms of the spanning set are included
- space: vector
- algebra: tensor
- algebra: graded
- duality
- integrability
- Feynman graph
References(98)
Figures(1)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [23]