Graphical functions and single-valued multiple polylogarithms

Feb 26, 2013
87 pages
Published in:
  • Commun.Num.Theor.Phys. 08 (2014) 589-675
  • Published: 2014
e-Print:

Citations per year

20132016201920222025051015
Abstract: (International Press)
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zigzag and two more families of ϕ4\phi^4 periods we give exact results modulo products. These periods are proved to be expressible as integer linear combinations of single-valued multiple polylogarithms evaluated at one. For the larger family of 'constructible' graphs, we give an algorithm that allows one to calculate their periods by computer algebra. The theory of graphical functions is used in [19] to prove the zig-zag conjecture.
Note:
  • 60 pages
  • computer: algebra
  • family
  • Feynman graph
  • field theory: scalar
  • graph theory