Fourier series of modular graph functions
Abstract
Modular graph functions associate to a graph an -invariant function on the upper half plane. We obtain the Fourier series of modular graph functions of arbitrary weight and two-loop order. The motivation for this work is to develop a deeper understanding of the origin of the algebraic identities between modular graph functions which have been discovered recently, and of the relation between the existence of these identities and the occurrence of cusp forms. We show that the constant Fourier mode, as a function of the modulus , consists of a Laurent polynomial in of degree , plus a contribution which decays exponentially as . The Laurent polynomial is a linear combination with rational coefficients of the top term , and lower order terms for , as well as terms for . The exponential contribution is a linear combination of exponentials of and incomplete -functions whose coefficients are Laurent polynomials in with rational coefficients.
Cite
@article{arxiv.1708.07998,
title = {Fourier series of modular graph functions},
author = {Eric D'Hoker and William Duke},
journal= {arXiv preprint arXiv:1708.07998},
year = {2018}
}
Comments
34 pages, in version 2, minor typos corrected and proof of theorem 1.3 made more precise