Modular and holomorphic graph function from superstring amplitudes
Abstract
We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we refine the formula for the asymptotic behaviour of holomorphic graph functions. Moreover, we give new evidence of a conjecture which relates these two asymptotic expansions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.