Modular graph functions and odd cuspidal functions - Fourier and Poincar\'e series

Modular graph functions are $SL(2,{\mathbb Z})$-invariant functions associated with Feynman graphs of a two-dimensional conformal field theory on a torus of modulus $\tau$. For one-loop graphs they reduce to real analytic Eisenstein series. We obtain the Fourier series, including the constant and non-constant Fourier modes, of all two-loop modular graph functions, as well as their Poincar\'e series with respect to $\Gamma _\infty \backslash PSL(2,{\mathbb Z})$. The Fourier and Poincar\'e series provide the tools to compute the Petersson inner product of two-loop modular graph functions using Rankin-Selberg-Zagier methods. Modular graph functions which are odd under $\tau \to - \bar \tau$ are cuspidal functions, with exponential decay near the cusp, and exist starting at two loops. Holomorphic subgraph reduction and the sieve algorithm, developed in earlier work, are used to give a lower bound on the dimension of the space $\mathfrak{A}_w$ of odd two-loop modular graph functions of weight $w$. For $w \leq 11$ the bound is saturated and we exhibit a basis for $\mathfrak{A}_w$.


Introduction
A modular graph function is a function associated to a certain Feynman graph for a twodimensional conformal field theory on a torus with complex structure τ . It is invariant under transformations of τ by the modular group SL(2, Z). Modular graph functions may be decomposed into even and odd pieces depending on their parity under τ → −τ , and their loop order is given by the number of loops of the corresponding Feynman graph. The weight w of a modular graph function is half of the degree of homogeneity in the momenta of the graph, and provides a grading on the ring of such functions. One-loop modular graph functions are always even and, for weight w, reduce to real analytic Eisenstein series E w .
The origin of modular graph functions at higher loop order may be traced back to string theory. The analytic structure of the genus-one superstring amplitude for four strings was analyzed in [1], and the low-energy expansion was organized in terms of modular functions in [2,3]. A systematic study of modular graph functions was initiated in [4,5] where they were shown to obey a system of differential and algebraic identities and in [6] where they were shown to be intimately related to single-valued elliptic polylogarithms. Further identities were derived in [7][8][9][10]. A key ingredient in the construction of these identities is the Laurent polynomial in Im (τ ) of the modular graph function. It governs the leading behavior at the cusp τ → i∞ and was obtained in closed form for an infinite class of even two-loop modular graph functions in [11], and for all graphs with four or fewer vertices in [12].
Modular graph forms, which associate an SL(2, Z) non-holomorphic modular form to a certain type of (decorated) graph, were introduced in [13][14][15], where a systematic method was developed to construct all the identities between them. An alternative construction in terms of Eichler type integrals was developed in [16]. The underlying nature of these identities remains to be fully uncovered, but it is already clear that they generalize to modular graph forms some of the algebraic identities which exist between multiple zeta values (see for example [17][18][19][20][21][22]). Direct connections between modular graph functions and single-valued elliptic polylogarithms were obtained in [6,[23][24][25]. The role of multiple zeta values in string amplitudes has been investigated extensively in [26][27][28][29][30]. Generalizations of modular graph functions for Heterotic string amplitudes were studied in [31][32][33]. Higher genus modular graph functions were introduced and analyzed in [34,35], building on earlier studies of special cases in [36][37][38], and further developed in [39][40][41].
In the present paper, we shall obtain the Fourier series, including constant and nonconstant Fourier modes, of arbitrary two-loop modular graph functions, thereby generalizing the results of [11]. The coefficients of the Fourier modes involve odd zeta values as well as a novel generalization of divisor sums. We also construct the Poincaré series of all twoloop modular graph functions in terms of a sum over Γ ∞ \P SL(2, Z), and compute the corresponding seed functions. The generalization of the construction of the Poincaré series to modular graph functions of arbitrary weight and loop order will be outlined as well.
The Fourier and Poincaré series expansions provide all the tools needed to evaluate integrals of two-loop modular graph functions over the fundamental domain of P SL(2, Z), as well as the Petersson inner product between modular graph functions, using the Rankin-Selberg-Zagier methods. Some of these integrals are needed to evaluate the contributions to the genus-one string amplitudes which are analytic in the external momenta [2,4].
Finally, we investigate the space A w of odd two-loop modular graph functions of weight w, and show that A w consists entirely of cuspidal functions, namely modular functions which have exponential decay near the cusp. Using the techniques of holomorphic subgraph reduction and the sieve algorithm developed in [13][14][15] we produce a lower bound on the dimension of A w by exhibiting families of linearly independent odd modular graph functions at each weight. For w ≤ 4 the space A w is empty, while for 5 ≤ w ≤ 11 the lower bound is saturated and we exhibit an explicit basis for A w .

Organization
In Section 2, we review the definition and basic properties of general modular graph functions and forms, define their parity under τ → −τ , discuss the one-loop and two-loop cases, and prove some basic decomposition formulas for two-loop modular graph functions. In Section 3, we obtain the Poincaré series for general modular graph functions, and compute the seed functions for the two-loop case. In Section 4 we carry out the calculation of the Fourier series expansion for arbitrary two-loop modular graph functions. In Section 5 we simplify the result for the constant Fourier mode, and extract the expansion for the non-constant Fourier modes. In Section 6, we review the holomorphic subgraph reduction procedure and sieve algorithm, construct infinite families of linearly independent two-loop odd modular graph functions, and produce a lower bound for the dimension of the space A w of odd modular graph functions of weight w. Finally, in Section 7 we discuss the action of the Laplace operator on two-loop odd modular graph functions and study Petersson inner products between them. Technical details of the calculations and some explicit formulas for complicated expansion coefficients are relegated to the Appendices.

Modular graph functions and forms
In this section, we shall review the definitions and basic properties of modular graph functions and forms, define even and odd modular graph functions, exhibit the action of differential operators, and illustrate the cases of one and two loops.

Definitions and basic properties
A decorated connected graph (Γ, A, B) with V vertices and R edges is defined as follows. The connectivity matrix Γ of the graph has components Γ v r where the index v = 1, · · · , V labels the vertices of the graph and the index r = 1, · · · , R labels its edges. No edge is allowed to begin and end on the same vertex. When edge r contains vertex v we have Γ v r = ±1, while otherwise we have Γ v r = 0. The decoration (A, B) of the graph is defined as follows, where a r , b r ∈ C with a r − b r ∈ Z for all r = 1, · · · , R. The pair (a r , b r ) is associated with edge r, while a, b are associated with the full decorated graph. To a decorated graph (Γ, A, B) we associate a complex-valued function on the Poincaré upper half plane H, defined by the following Kronecker-Eisenstein sum, whenever this sum is absolutely convergent. The momentum lattice is given by Λ = Z + τ Z for τ ∈ H with Λ = Λ \ {0}. The momenta p r depend holomorphically on H. We refer to a r and b r as the exponents of respectively holomorphic and anti-holomorphic momenta. The Kronecker δ-symbol equals 1 when its argument vanishes and 0 otherwise. The number of loops L is the number of independent momenta, given by L = R − V + 1. The domain of absolute convergence of the sums in (2.2) is given by a system of inequalities on the combinations Re (a r + b r ), beyond which the functions C of (2.2) may be defined by analytic continuation in the variables a r + b r . The function C Γ in (2.2) vanishes whenever the integer a − b is odd, or whenever the graph Γ becomes disconnected upon severing a single edge. A function C Γ associated with a connected graph Γ which is the union of two graphs Γ = Γ 1 ∪ Γ 2 whose intersection Γ 1 ∩ Γ 2 consists of a single vertex factorizes into the product C Γ 1 C Γ 2 with the corresponding partitions of the exponents. Henceforth, we shall assume that a − b is even, and that the graph Γ remains connected upon the removal of any single edge or vertex.
Under SL(2, Z), the functions defined in (2.2) transform as follows, where α, β, γ, δ ∈ Z and αδ − βγ = 1. The modular weight of C Γ is given by the pair ( a−b 2 , b−a 2 ) which has integer entries since a − b is even. For a = b, the function C Γ transforms as a non-holomorphic modular graph form. For a = b the function C Γ is SL(2, Z)-invariant and referred to as a modular graph function of weight 1 w = a = b.
A modular graph form is invariant under permutations of its vertices and its pairs of exponents (a r , b r ). It obeys a momentum conservation identity at each vertex v = 1, · · · , V , The R-dimensional array S r is defined to have zeroes in all slots except for the r-th, where 0 stands for an array of zeros. The momentum conservation identities provide linear algebraic relations between modular graph forms of the same modular weight.

Graphical representation
Though it will not be used much in the present work, we now briefly review the graphical representation of modular graph functions and forms. The generating function of modular graph functions with N vertices is given as follows, where Σ is a torus with complex structure modulus τ and G(z i − z j |τ ) is the scalar Green function on Σ, given as a Fourier sum by for z = α + βτ . Modular graph functions may be represented by Feynman graphs on Σ as follows. We begin by representing a Green function graphically by an edge in a Feynman diagram, The integration over the position of a vertex z on which r Green functions end is denoted by an unmarked filled black dot, in contrast with an unintegrated vertex z i which is represented by a marked unfilled white dot. The basic ingredients in the graphical notation are depicted in the graph below, For our purposes, we will be interested only in those cases in which all positions on the torus have been integrated over, and hence all nodes in the diagrams are filled and unmarked. More generally, modular graph forms may be obtained by considering derivatives of the scalar Green functions, which given rise to differing exponents (a r , b r ) for the holomorphic and anti-holomorphic momenta p r ,p r . These exponents are represented graphically by decorated edges as follows, a r , b r ≈ (p r ) −ar (p r ) −br (2.10) As a simple example, for Γ 1r = 1 and Γ 2r = −1, r = 1, 2, 3, one has

Modular graph functions of even and odd parity
Parity is an anti-holomorphic automorphism of the upper half plane τ → −τ under which an arbitrary modular graph form transforms by swapping the arrays A and B, thereby swapping the modular weights ( a−b 2 , b−a 2 ) and ( b−a 2 , a−b 2 ). For a = b it is consistent to decompose an arbitrary modular graph function into even and odd modular graph functions C Γ = S Γ + A Γ which satisfy, We note that whenever A = B we have A = 0. When the exponents a r , b r are all integers, the parity operation on C Γ is equivalent to complex conjugation of C Γ .

Action of differential operators
The choice made for the exponent of the τ 2 prefactor in the definition of (2.2) ensures the canonical normalization in which the modular weight vanishes for a = b. For a = b, however, there is no such canonical normalization available, and the action of differential operators is made more convenient by changing normalization to modular forms C + Γ and C − Γ of respective modular weights (0, b − a) and (a − b, 0) defined as follows, 14) The action of the first order operator ∇ = 2iτ 2 2 ∂ τ on modular graph forms C + Γ is simple since no connection is required, and the same is true for the action of ∇ = −2iτ 2 2 ∂τ on modular graph forms C − Γ . The action of the operators ∇ and ∇ may be expressed as follows, where the row matrix S r was defined in (2.5). The operator ∇ maps modular graph forms of modular weight (0, b − a) to those of modular weight (0, b − a − 2), and similarly for ∇. The Laplace-Beltrami operator on modular graph functions is the Laplace operator on H given by ∆ = 4τ 2 2 ∂τ ∂ τ and maps the space of modular graph functions into itself, The action of the Laplace-Beltrami differentials on modular graph forms may be defined analogously, but will not be needed in this paper. Since the operator ∆ commutes with parity τ → −τ , it maps even into even, and odd into odd modular graph functions. The explicit formula for these actions may be obtained by simply substituting C on both sides of the equality in (2.16) by either S Γ or A Γ .

One-loop modular graph forms and Eisenstein series
The combinatorial complexity of modular graphs forms increases rapidly with the number of loops. At one loop, the number of vertices equals the number of edges, so that all vertices are bivalent. The case V = R = 1 is excluded since the edge begins and ends on the same vertex. For V = R ≥ 2 all one-loop modular graphs forms are given for a r − b r ∈ Z by, where a, b are given by (2.1). The non-holomorphic Eisenstein series E s is defined by, The Fourier series of E s for s ∈ C is given by, where K is the modified Bessel function and σ z (N ) = 0<d|N d z is the divisor sum. The one-loop modular graph forms of (2.17) may all be expressed in terms of E s . There are no odd modular graph functions to one-loop order, and the Eisenstein series are the only even modular graph functions to one-loop order. Successive application of the derivatives ∇ and ∇ to E s produces all one-loop modular graph forms, For integer s = k ≥ 2 the derivative is proportional to a holomorphic Eisenstein series G 2k , For integer s the Fourier series of E s simplifies and may be recast as follows, where q = e 2πiτ , B 2k are the Bernoulli numbers, and P k (x) is a polynomial in 1/x given by,

Two-loop modular graph forms
Two-loop modular graph forms are given by the following Kronecker-Eisenstein sum, where the weight w is given by, For a r , b r ∈ Z with r = 1, 2, 3, the sum is absolutely convergent provided a r + b r + a s + b s ≥ 3 for any pair r = s, which requires w ≥ 3. Furthermore, we shall restrict attention to the case where all exponents are non-negative, as is natural from the point of view of string theory. The space of modular graph forms thus obtained contains forms that are effectively oneloop. Forms with b r = 0 and a r ≥ 2 are proportional to holomorphic modular forms G 2w . When both exponents of a given momentum vanish, we may use the algebraic reduction relation of [13,14] to relate the form to one-loop forms, where a = a 1 + a 2 and b = b 1 + b 2 . Finally, when two anti-holomorphic exponents vanish, holomorphic subgraph reduction may be used to relate the form to a one-loop form, as will be reviewed in more detail in Section 6.
The following proposition provides a systematic decomposition of two-loop modular graph forms into a reduced set of such forms, Proposition 2.1 Two-loop modular graph forms with a r + a s + b r + b s ≥ 3 for all r = s and a 1 , a 2 , b 1 , b 2 ≥ 1 admit the following decomposition, where the term (1 ↔ 2) is obtained from the preceding term by swapping the pairs (a 1 , b 1 ) with (a 2 , b 2 ) leaving (a 3 , b 3 ) unchanged, and Λ is proportional to a binomial coefficient, Odd (resp. even) two-loop modular graph functions admit the same decomposition with the symbol C replaced by A (resp. S) on both sides of the equality.
To prove the proposition, we perform a partial fraction decomposition of the holomorphic factor of the summand in terms of the momentum variable p 3 = −p 1 − p 2 , and obtain, Using the restriction b r ≥ 0, the anti-holomorphic factor of the summand multiplying the first sum in (2.29) may be decomposed as follows, while the factor multiplying the second term in (2.29) is given by (2.30) with the indices 1 and 2 swapped. The resulting decomposition is then given by (2.27). Symmetrization under τ → −τ then immediately gives the final statement.
The proof is an immediate consequence of Proposition 2.1 obtained by setting a 3 = b 3 = 0.

Corollary 2.3
For k, , a − k, b − ≥ 1, and a + b − k − ≥ 3, the reduced modular graph forms are related by the reflection formula, The proof proceeds by partial fraction decomposition of the holomorphic momenta onto p 3 . The modular graph functions appearing on the last line of Corollary 2.3 may be expressed in terms of one-loop functions using the algebraic reduction formula of (2.26) and in turn may be expressed in terms of Eisenstein series and their derivatives using (2.20).

Poincaré series for two-loop modular graph functions
In this section, we shall construct the Poincaré series for two-loop modular graph functions with respect to the coset Γ ∞ \P SL(2, Z), and outline the generalization to higher loop orders.

Poincaré series for two loops
For integer exponents, we use the result of Proposition 2.1 to decompose an arbitrary twoloop modular graph function of weight w = a = b into a linear combination of modular graph functions of the form, where u, v, w are integers satisfying 1 ≤ u, v ≤ w − 1. These functions satisfy the complex conjugation condition C u,v;w = (C v,u;w ) * . Their Kronecker-Eisenstein sum is given as follows, where m = m 1 + m 2 + m 3 , n = n 1 + n 2 + n 3 and the Kronecker δ m,0 δ n,0 restricts the sum to contributions for which m = n = 0.
We shall obtain the Poincaré series for a generalization of the functions C u,v;w where u, v are positive integers but w is analytically continued to C. This generalization will be useful when we evaluate Petersson inner products of modular graph functions.
Theorem 3.1 The Poincaré series for C u,v;w with respect to Γ ∞ \P SL(2, Z), for exponents u, v ∈ N and w ∈ C, is given by the analytic continuation in w from Re (w) > 1 of, where the seed function is given by, Here ζ(s) is the Riemann zeta function. To prove (3.1), we use a standard lemma [42], Lemma 3.2 For every pair (m 2 , n 2 ) ∈ Z 2 \ {(0, 0)} there exists a unique pair (0, n) and a unique g ∈ Γ ∞ \P SL(2, Z), such that we have the following matrix relation, with αδ − βγ = 1 and n = ± gcd(m 2 , n 2 ). The unique solution is given by γ = m 2 /n and δ = n 2 /n such that δ > 0 if n 2 = 0 and γ > 0 if n 2 = 0.
To prove the lemma, we show that the equations m 2 = nγ, n 2 = nδ, and αδ−βγ = 1 have a unique solution given the conditions of the lemma. Since (m 2 , n 2 ) = 0 and gcd(γ, δ) = 1, we have n = ± gcd(m 2 , n 2 ) where the greatest common divisor is defined to be positive. The sign may be fixed by using g ∈ P SL(2, Z) which allows us to choose δ > 0 if n 2 = 0 and γ > 0 if n 2 = 0. Thus γ and δ are determined uniquely. The group Γ ∞ is given by, Acting to the right on (0, n) leaves (0, n) invariant. Acting to the left on g transforms α → α+νγ and β → β +νδ for ν ∈ Z and thus maps all solutions of the equation αδ −βγ = 1 for given γ, δ, into one another. Therefore, the coset element g ∈ Γ ∞ \P SL(2, Z) is unique. To prove Theorem 3.1, we use the results and the notations of Lemma 3.2 to obtain, where (m r , n r ) = (0, 0) for r = 1, 3, n = 0, and subject to the conditions m 1 + m 3 = 0, and n 1 + n + n 3 = 0. Parametrizing these variables by n, m 1 = −m 3 = m, n 1 = µ, and n 3 = −n − µ, and substituting these results into the Kronecker-Eisenstein sum which defines C u,v;w (τ ) in (3.2), we prove Theorem 3.1.

Calculating the seed function for integer w
Throughout this paper we shall use the following partial fraction decomposition formula, for u, v ∈ N. We shall now derive an explicit formula for the seed function Λ u,v;w (τ ). Its first contribution involves the coefficient w which is given by the m = 0 term, The summation over µ in (3.9) may be carried out using the partial fraction decomposition of the µ-dependent factors with x = 0 and y = n in (3.8). For integer w, the remaining sum over n gives even ζ-values resulting in the formula for w in (3.4). We may express the even zeta-values ζ(2k) in terms of Bernoulli numbers B 2k using the relation, and obtain the following equivalent formula, This expression agrees with the result (−) w c w found for even u and v in [11], and generalizes that result for all u, v. The second contribution Λ is evaluated using the following lemma.

Lemma 3.3
For integer w, the function Λ u,v;w (τ ) is given by, where q = e 2πiτ and the notation (u ↔ v) * stands for the complex conjugate of the preceding term in which u and v have been swapped. The functions ϕ k and Φ a;b are defined for integer k, a, b with k ≥ 2 and a + b ≥ 2 by the following infinite sums, Explicit formulas for ϕ k will be given in (3.16) and (3.17) and for Φ a;b in (3.18).
The powers of i are included to give the functions simple conjugation properties, In particular, the functions ϕ k and Φ a;b are real functions of their respective argument. The proof of Lemma 3.3 proceeds by first computing the sum over µ ∈ Z using the standard partial fraction decomposition formula of (3.8) with u, v ∈ N, x = mτ , and y = mτ + n, and expressing the result of the summation in terms of ϕ k , Importantly, the factor ϕ k (q m ) is independent of n which allows us to express the sum over m in terms of the function Φ a;b (2mτ 2 ) defined above, and this gives the expression in (3.12).

Evaluating the functions ϕ k and Φ a;b (z)
The functions ϕ k (q) for k ≥ 2 may be expressed as derivatives of the function ϕ 1 (q), Their Fourier series expansion for |q| < 1 is obtained as follows, To evaluate the function Φ a;b (z) for integer a, b ≥ 1 we perform first the sum over n, using the partial fraction decomposition formula (3.8) for µ = n, x = 0, y = −iz, u = a, v = b, together with the definition of the function ϕ k . We find, The contribution from α = 0 in the sum over α arises from the subtraction required to exclude the m = 0 term when recasting the sum over n in terms of the function ϕ β . Despite the appearance of poles at z = 0 in the individual terms of the sum in (3.18), the function Φ a;b (z) is analytic near z = 0 and, for a, b ≥ 1 with z in the unit disc |z| < 1, is given by the following Taylor expansion, The B a+b+k vanish for a + b + k odd since we have a + b + k ≥ 2. The expression (3.19) confirms the earlier observation that Φ a;b (z) is a real function of z with parity (−) a+b . We stress that both ϕ k and Φ a;b are elementary functions of their argument.

Analytic continuation in w
The multiple summation for the seed function in Theorem 3.1 is absolutely convergent for u, v ∈ N, Re (2w − u) > 2, and Re (2w − v) > 2, and the result may be analytically continued in w to all of C minus some poles. For w ∈ C \ N, the decomposition of Lemma 3.3 in terms of elementary functions Φ a;b is no longer available. Instead we have, where Υ is given by, For integer w we recover the expressions given in (3.4), but for arbitrary w ∈ C we can no longer use partial fraction decomposition to simplify Υ. Its Taylor series expansion, is valid for all w ∈ C.

Higher loops
We shall generalize the construction of Poincaré series to higher loops and focus on the case of dihedral modular graphs functions whose Kronecker-Eisenstein sum is given by, Here, the number of loops is R − 1 and we have w = a = b with a, b defined in (2.1). We single out any one of the momentum edges, say p R = m R τ + n R , and apply Lemma 3.2 to the pair (m R , n R ). In matrix notation, we thus recast the pair as follows, (m R n R ) = (0 n)g g = α β γ δ α, β, γ, δ ∈ Z (3.24) with αδ − βγ = 1 and n = ± gcd(m R , n R ). The unique solution is given by γ = m R /n and δ = n R /n such that δ > 0 if n R = 0 and γ > 0 if n R = 0. By generalizing the arguments used in the two-loop case, we thus have, The seed function Λ is given by, Effectively the sum over p R in C is replaced by a sum over p R = (0 n) with n = 0 in Λ.

Fourier series for two-loop modular graph functions
In this section we shall evaluate the Fourier series expansion of an arbitrary two-loop modular graph function with integer exponents. As in the previous section we use Proposition 2.1 to reduce this calculation to evaluation of the Fourier series of the reduced modular graph functions C u,v;w (τ ), defined in (3.1), for u, v, w ∈ N. We require u + v ≥ 3, 2w − u ≥ 3, and 2w − v ≥ 3 to ensure convergence of the Kronecker-Eisenstein series which define C u,v;w in (3.2), and these conditions require w ≥ 3. The Fourier decomposition of C u,v;w (τ ) is given by the following theorem.
The two-loop modular graph function C u,v;w with integer exponents u, v, w ∈ N admits the following Fourier series expansion, Here, the functions occurring in the constant Fourier mode, L u,v;w (τ 2 ) and Q occurring in the non-constant Fourier modes are real-valued functions which have an expansion in powers of qq, u,v;w (τ 2 ) are real-valued Laurent polynomials in τ 2 . The degrees of these Laurent polynomials are given as follows, where β + , + , and γ + are defined as Explicit formulas for these Laurent polynomials will be given in subsequent sections.

Corollary 4.2 An immediate corollary of Theorem 4.1 is obtained for odd two-loop modular graph functions with integer exponents defined by
Their Fourier expansion is given by, so that A u,v;w (τ ) is a cuspidal function with exponential decay at the cusp.

Decomposition of the Kronecker-Eisenstein sum
To prove Theorem 4.1 and calculate the coefficient functions in the Fourier series (4.1), we start from the Kronecker-Eisenstein sum representation of C u,v;w , given by, and decompose the sum according to the vanishing of the summation variables m r , The individual terms correspond to the following assignments of m r and n r , We shall show that the Fourier series decompositions of the functions C (k) u,v;w may be computed in terms of the functions Φ a;b and ϕ k defined in (3.13). The calculation of C (0) u,v;w was already carried out when we evaluated the coefficient w in (3.9), and the result is given by, with w given explicitly in the second equation of (3.4). The remaining functions C

Calculation of
u,v;w by swapping the summation variables (m 1 , n 1 ) with (m 2 , n 2 ) or equivalently by simultaneous complex conjugation and swapping u and v, an operation that will be denoted by (u ↔ v) * throughout. We begin by evaluating C (1) u,v;w , and express the sum in terms of the independent variables m = m 3 , n = n 3 , and n 1 , It is natural to perform first the summation over n. Since the denominator has three different factors involving n, we need to perform a double partial fraction decomposition. Performing first the partial fraction decomposition on the last two factors for the variable n we find, where the functions K and L are given by, Throughout, the dependence of K u,v;k and L u,v;k on m and τ will be understood but not exhibited. The factors of i have been inserted to make them real functions of their arguments.
To compute K u,v;k , we carry out a partial fraction decomposition in n, and then sum over n in terms of the function ϕ k defined in (3.13). The sum over n 1 may then be carried out in terms of the functions Φ a;b defined in (3.13), and we find, To compute L u,v;k , we carry out a partial fraction decomposition in n and express the sum over n in terms of the functions ϕ k , The sum over n 1 vanishes unless u + v + k − is even. Thus we change summation variables from to u + v + k − = 2j, so that the sum becomes, Note that the = 1 contribution, which is given by the j = [ u+v+k−1 2 ] contribution in the above sum, cancels exactly so that every term has a non-constant Fourier mode.
u,v;w , we find, The functions K u,v;k and L u,v;k involve ϕ k , Φ a;b , and factors that are power behaved in τ 2 .
As will be shown in the subsequent section, the infinite sum over m may be performed for the terms that are purely power behaved in τ 2 . For the exponential terms the values of m will label the powers in q andq and, for a given assignment of powers of q andq, the sums over m will reduce to finite sums.

Calculation of C
Expressing the sum in terms of the independent summation variables m = m 1 , n = n 3 , and n 1 , this contribution becomes, Carrying out the partial fraction decomposition in n 1 , summing over n 1 in terms of the function ϕ k , and expressing the sum over n in terms of the function Φ a;b , we find, u,v;w none of the summation variables m r vanish. We shall use independent continuous variables to abbreviate the m-dependence by letting m 1 τ → α, m 2τ → β, and m 3 τ → γ, and recast the sum over m r in terms of a function Ω u,v;w of the continuous variables α, β, γ, where the function Ω is defined by, The partial fraction decomposition of the last two factors in the denominator with respect to n 3 may be expressed in terms of a family of functions Ψ u,v,k defined by, The function Ψ u,v,k (α, β, γ) is invariant under all six permutations of the pairs (u, α), (v, β), and (k, γ). In terms of Ψ, the function Ω may be expressed as follows, To calculate the function Ψ, we use the following observation, Ψ 1,1,1 is readily evaluated by partial fraction decomposition and summation in the variables n 1 and n 2 , and we find, The successive derivatives may be obtained using a trinomial expansion for Leibnitz's rule, and we find the following expression, where we use the following notation for the trinomial coefficients, Substituting the expression for Ψ u,v,k into Ω and substituting the original values for the continuous variables α = m 1 τ , β = m 2τ , and γ = m 3 τ , we find,

The Fourier coefficient functions
In this section, we shall present the results for all the Fourier modes of C u,v;w in Theorem 4.1. The details of the calculations of the Laurent polynomial L u,v;w (τ 2 ) will be relegated to Appendices A and B. Likewise, the details of the calculations of the exponential contributions, including the Laurent polynomials Q u,v;w , will be relegated to Appendix C. Various coefficients in the Laurent polynomials F u,v;w involve rational numbers given by lengthy expressions of finite sums and will be presented in Appendix D. In the present section, we shall summarize all of these results.

Decomposition of the functions ϕ k and Φ a;b
To extract the Fourier coefficient functions from the formulas for C u,v;w (τ ) computed in the previous section, we decompose the elementary functions ϕ k and Φ a;b into parts which are purely Laurent polynomial in τ 2 and parts which are exponential, where the sign function ε(m) is defined by, The functions appearing in (5.1) are given as follows, We have taken this opportunity to expose the dependence on the sign of the summation variable m for all functions involved.

The Laurent polynomial L u,v;w
The Laurent polynomial L u,v;w of C u,v;w is given by the following theorem.
Theorem 5.1 The Laurent polynomial L u,v;w of C u,v;w is given as follows, The coefficient w ∈ Q arises solely from C (0) u,v;w and was given in (3.4). The coefficients 2k−w+1 ∈ Q arise from C (i) u,v;w with i = 1, 2, 3 and are given by, where B 2k are the Bernoulli numbers and the symmetrization u ↔ v applies only to the first line. The Heavisde θ-function is defined such that θ(x) = 1 for x ≥ 0 and zero otherwise.
u,v;w with i = 1, 2, 3, 4 and is given as follows, where the symmetrization (u ↔ v) applies to the entire expression. The combination of multiple zeta values in the second term and of powers of π in the first may be simplified and gives 2−w as a bilinear combination of odd zeta values whose total weight is 2w − 2, The double zeta value ζ(s, t) in the first expression for 2−w is defined by, We note that the validity of the form of the expression given for 2−w in (5.7) was proven for the two-loop modular graph functions functions C a,b,c in [11], and may be proven by the same methods in the case of the functions C u,v;w . However, the expressions for the coefficients λ k can be obtained only upon assuming the validity of a conjecture. The coefficients in the bilinear combination of odd zeta values given in Conjecture 1.4 of [11] was obtained with the help of an identity between rational numbers given in Conjecture 6.2 of that paper, which was verified to high order by MAPLE. Applying Conjecture 6.2 of [11] to the expression for 2−w , we obtain the following expression for the coefficients λ k , Proposition 5.2 (Obtained by assuming the validity of Conjecture 6.2 of [11].) The coefficients λ k in the Laurent series for C u,v;w are given as follows, , and E n (0) are Euler polynomials evaluated at 0.
The Euler polynomials E n (t) (not to be confused with the Eisenstein series E s (τ )) may be defined by the following generating function, The proof of Theorem 5.1 is given in Appendix A, while the proof of Proposition 5.2, assuming the validity of Conjecture 6.2 of [11], is given in Appendix B.

Generalized divisor sum functions
In the calculation of non-constant exponential contributions to C u,v;w to which we next turn, we shall encounter a generalization of the standard divisor functions σ s (N ) = 0<n|N n s . We introduce these generalized divisor sums now. For M, N ∈ N and A, B, C ∈ Z, we introduce the following generalized divisor function, In contrast to the standard divisor sum, the summation here is carried out over both positive and negative divisors m, n. The function V A,B,C (M, N ) vanishes when A + B + C is an odd integer since the summand is then odd under the reversal of the signs of both m and n. To account for this property in a systematic manner, we introduce the function, which vanishes for n odd and equals 1 for n even. A more explicit formula for V A,B,C (M, N ) may be obtained by separating the contributions from positive and negative m, n, The exponential part of the constant Fourier mode Q We now proceed to the calculation of the exponential part of the constant Fourier mode. To obtain this, we retain the contributions with identical powers of q andq in C u,v;w , namely all terms of the form (qq) N . The calculation of the exponential contributions will be carried out in Appendix C, and the contributions to Q (N ) u,v;w are organized in Appendix D. The result may be stated in the form of the following theorem.

Theorem 5.3
The exponential part of the constant Fourier mode of C u,v;w is given by, where the symmetrization in u, v applies to both lines. The coefficients are all rational functions, and are given by, The functions V A,B,C (M, N ) and I n appearing above were defined in subsection 5.3.

The non-constant Fourier modes F
and = u + v (mod 2). The coefficients W k, ,β u,v;w (N, L) and H k, ,β u,v;w (N ) are rational numbers for all integer-valued arguments and indices. The function M k, u,v;w (N ) is shown in (D.26) and gives rational multiples of odd zeta values.
This completes the calculation of the full Fourier expansion for general two-loop modular graph functions, all of which may be constructed from C u,v;w . In the following subsection we illustrate these results by means of an explicit example.

5.6
An example: C 2,1,1 We now illustrate our results for the familiar case of two-loop modular graph functions C a,b,c . To utilize the results of the previous sections, we must first recast these modular graph functions in terms of the basis C u,v;w . One finds for example It is known that C 2,1,1 has the following Laurent polynomial [14], with y = πτ 2 . Using Mathematica, one verifies that Theorem 5.1 reproduces this result, The exponential part of the Fourier series of C 2,1,1 can be obtained by exploiting the following differential equation, as well as the known Fourier expansion (2.22) of the non-holomorphic Eisenstein series. Let us define the coefficients of the Fourier expansion as C (M,N ) 2,1,1 , such that, We begin by obtaining the exponential part of the constant Fourier mode, denoted by Q (N ) in (4.1). The only contribution of the form (qq) N to the right-hand side of (5.21) comes from E 2 2 , as can be seen from (2.22). Using the latter formula gives the following differential equation for C The solution is found to be In other words, we expect from (5.18) that Using Mathematica, one may check that this is indeed the result given by Theorem 5.3.
One may now similarly proceed to obtain the non-constant contributions. For example, the Laplace equation (5.21) together with appropriate boundary conditions yields the following results, One may check that these are consistent with the results of Theorem 5.4 for F (1) , F (2) , and G (1,1) respectively, and that the first line is consistent with equation (5.7) of [4].

The space of odd two-loop modular functions
In this section, we shall study the space A w of odd two-loop modular graph functions of weight w. They are cuspidal functions with exponential decay at the cusp. Using holomorphic subgraph reduction and the sieve algorithm studied in [13][14][15], we shall exhibit a subspace of A w consisting of functions which may be expressed in terms of Eisenstein series, construct two other linearly independent subspaces, and use these results to give a lower bound on the dimension of A w . Finally, we shall show that A w is trivial for w ≤ 4 and that the lower bound is saturated for 5 ≤ w ≤ 11.

Odd two-loop modular graph functions
Odd two-loop modular graph functions may be obtained from general two-loop modular graph functions by taking their parity odd part, where the total exponents a, b, defined by, are equal to one another and the weight w is given by w = a = b. We shall impose the following restrictions in order to obtain a space on which differential operators, such as the Laplace operator, act consistently, a r , b r ≥ 0, a r + a s + b r + b s ≥ 3 for r = s at most one a r and at most one b r vanishes (6. 3) The following theorem is an immediate consequence of the structure of the Fourier series for two-loop modular graph functions given in the preceding section, and in particular follows from the reality of the Laurent polynomial L u,v;w .
Theorem 6.1 All odd two-loop modular graph functions in A w are cuspidal functions.
The exponential suppression at the cusp of odd modular graph functions allows us to introduce the Petersson inner product on the space A = w A w , which is defined by, for A 1 , A 2 ∈ A and where M is a fundamental domain M = H/P SL(2, Z).
Using Proposition 2.1 all odd two-loop modular graph functions may be expressed as linear combinations of the following functions, for which we adopt a convenient notation, Without loss of generality, we restrict the range of parameters to 1 ≤ u < v ≤ w − 1. This restriction gives a trivial upper bound on the dimension dim A w ≤ 1 2 (w − 1)(w − 2). However, many linear relations exits between the functions of (6.5), and one readily shows A 1,2;3 = A 1,2;4 = A 1,3;4 = A 2,3;4 = 0 so that To investigate the spaces A w with w ≥ 5, we shall use holomorphic subgraph reduction and the sieve algorithm, which we review in the next two subsections.

Holomorphic subgraph reduction
A systematic sieve algorithm was developed in [13,14] to prove identities between modular graph forms. The key ingredient is the use of the Cauchy-Riemann operator ∇ = 2iτ 2 2 ∂ τ to relate identities between modular graph forms to identities between holomorphic Eisenstein series, using holomorphic subgraph reduction.
Applying the Cauchy-Riemann operator to an odd modular graph function will produce a modular graph form. Thus, we shall need to work on a larger space, of two-loop modular graph forms given by the Kronecker-Eisenstein sums of (2.24). For independent total exponents a, b ≥ 2, we define the spaces, a r , b r ≥ 0, a r + a s + b r + b s ≥ 3 for r = s at most one a r and at most one b r vanishes (6.7) while for a = 1 or b = 1, we define the spaces as follows, The restriction that at most one a r and at most one b r is allowed to vanish provides a selfconsistent truncation, and guarantees that the Laplace operator maps V (a,a) to itself [13,14]. The spaces V (a,b) for a, b ≥ 2 and a + b ≥ 6 also contain one-loop modular graph functions and products of one-loop modular graph functions as was shown in (2.26). The operator ∇ acts as follows on an arbitrary two-loop modular graph form C + ∈ V (a,b) , where (i, i , i ) is a cyclic permutation of (1, 2, 3). The operator ∇ maps V (a,b) to forms of weight (a + 1, b − 1), but these forms do not necessarily belong to V (a+1,b−1) . Indeed, an exponent with value −1 can occur in the entry i of the lower row of exponents when the corresponding exponent b i vanishes. Given the definition of V (a,b) , this means that the other two lower exponents b i , b i are non-zero so that the momentum conservation identities of (2.4) can be used to convert the modular form with a negative entry into modular forms whose entries are all non-negative. These modular forms, however, still do not necessarily belong to V (a+1,b−1) since two zeros may appear in the lower row. This is the point where holomorphic subgraph reduction enters, as the Kronecker-Eisenstein sum now contains a holomorphic subgraph sum which, for the case of two-loops, may be reduced as follows, where we have used the notation a 0 = a 1 + a 2 . The form G 2k is defined by G 2k (τ ) = (τ 2 ) 2k G 2k (τ ) for k ≥ 2 while G 2 = τ 2 2 G 2 is the non-holomorphic modular covariant weight two Eisenstein series. It was shown in [13,14] that ∇ applied to any form in V (a,b) produces linear combinations of modular graph forms in which the last two terms on the right side in (6.10) cancel, so that G 2 never appears in the range ∇V (a,b) .

The sieve algorithm
The sieve algorithm, developed in [13], can be stated simply and explicitly for two-loop graphs. Holomorphic subgraph reduction shows that the range ∇V (a,b) contains modular graph forms of weight (a + 1, b − 1) which do not belong to V (a+1,b−1) . Those modular graph forms belong to the space C (a+1,b−1) specified by the following lemma. 2 Lemma 6.2 For a − b ∈ 2Z and a, b ≥ 2 the following sum is direct, We shall prove the lemma by showing that the asymptotics near the cusp, given by a Laurent series up to exponential corrections, are linearly independent. The Laurent series in τ 2 may be obtained by combining the asymptotics of (2.22) with the first equation in (2.20) when a ≥ b, and with the second equation of (2.20) when a ≤ b. The result may be combined into the following expression which is valid in both cases, where ν a , ν b = 0. The asymptotics of G 2k = (τ 2 ) 2k G 2k is given by τ 2k 2 in view of (2.21), so that the asymptotics of the term with summation index k in (6.11) is proportional to where ν a , ν b = 0. The linear independence of the terms in τ 1+2k−b 2 then shows linear independence of the full functions, which proves the lemma.

The sieve
From the definition of C (a,b) it is clear that V (a,b) ∩ C (a,b) = 0, so that ∇ acts as follows, We define an ordered set of subspaces of C (a,b) , or sieve, by the following iterative procedure. Starting with n = 1, we define V (a,b) to be the maximal subspace of V (a,b) whose range under ∇ has vanishing component along C (a+1,b−1) , The process may be repeated to define V (a+1,b−1) to be the maximal subspace of V (a+1,b−1) on which the range of ∇ has vanishing component along C (a+2,b−2) by, In turn the space V For the general case, we continue the iterative process by defining V The process ends when n = b − 1 because it follows from the definition (6.7) that V (a,1) vanishes for even a and is one-dimensional for odd a generated by ∇ w−1 E w with 2w − 1 = a.

Direct sum decomposition
Of fundamental importance in the application of the sieve algorithm are the difference spaces U (n) (a,b) defined by the following direct sum decompsitions, Therefore, we have, These relations do not define the elements in the spaces U (n) (a,b) uniquely, but we achieve uniqueness by requiring, Thus, the subspaces U (n) (a,b) collect the obstruction to ∇ mapping to V (a,b) spaces. For the special case of modular graph functions with a = b = w the sieve reduces to, The Eisenstein series E w belongs to each space in the sieve E w ∈ V (n) (w,w) for all 0 ≤ n ≤ w − 1.

Odd modular graph functions from Eisenstein series
An important subspace of odd two-loop modular graph functions of weight w is constructed from the following two-loop modular graph functions of weight w = a 1 + a Convergence of the sums which define the modular graph functions in (2.24) requires a 1 +b 1 ≥ 3 and a 2 + b 2 ≥ 3. Using the decomposition of Corollary 2.2, these functions are linear combinations of the functions A u,v;w with the range for u, v defined in (6.5). Applying the algebraic reduction formulas of (2.26) to A, we find, If a 1 + b 1 is an odd integer, and thus a 2 + b 2 is also odd, each factor on the right side of (6.24) vanishes and the resulting A is zero. Assuming now that a 1 + b 1 is even and, without loss of generality, that a 1 ≥ b 1 , we define the following combinations, where k ≥ 0, and w = w 1 + w 2 with w 1 , w 2 ≥ 2. We use the expressions of (2.20) for one-loop modular graph functions in terms of derivatives of Eisenstein series to simplify A as follows, where the function P is given as follows, Manifestly, the function P k (w 1 , w 2 ) vanishes for k = 0 and is odd under swapping w 1 and w 2 . Thus we shall assume k ≥ 1 and w 1 > w 2 . We have A ∈ A w whenever none of the exponents a 1 , a 2 , b 1 , b 2 vanishes or, in this case, we have P k (w 1 , w 2 ) ∈ A w whenever k + 1 ≤ w 2 < w 1 .
We define the corresponding subspace as follows, A (1) w = P k (w 1 , w 2 ) with w = w 1 + w 2 and 1 ≤ k < w 2 < w 1 (6.28) Note that P w 2 (w 1 , w 2 ) does not belong to A w but instead belongs to C (w,w) defined in (6.11).

The spaces A
w and A We now introduce two further subspaces A w ⊂ A w , defined as follows, The following subsections will rely on the following theorem, proven in Appendix E.

Bounds on the dimension of A w
The construction of the subspaces A w , and A w , and Theorem 6.3 allow us to put a lower bound on dim A w . Together with the upper bound given after (6.5), we have, Explicit computation shows that this lower bound is saturated for w ≤ 11, while for w ≥ 12 there are additional contributions. We find the following values for dim A w for w ≤ 12, In the next subsection we illustrate this explicit computation for the simplest case of A 5 .

Constructing a basis for dim A 5
To make the discussion of this section more concrete, we illustrate here the construction of a basis for A 5 using holomorphic subgraph reduction and the sieve algorithm. By definition (6.3), the space A 5 is generated by the following six functions, The unique weight five P-function P 1 (2, 3) is a linear combinations of the above functions.
We shall now use the sieve algorithm to construct all linear relations between the functions A u,v;w . To this end we apply ∇ repeatedly until we produce a modular form G 2k = τ 2k 2 G 2k proportional to the holomorphic Eisenstein series G 2k for k ≥ 2. Applying ∇ once, we obtain, ∇A 1,2;5 , ∇A 2,3;5 ∈ V (6,4) (6.35) as well as Retaining A 1,4;5 as a first basis function of A 5 , we take linear combinations A 1,3;5 − A 1,4;5 , A 2,4;5 − A 1,4;5 , and A 3,4;5 + A 1,4;5 whose image under ∇ is in V (6,4) in view of (6.36). Applying ∇ 2 to these functions, and ∇ to the forms in (6.35), we obtain, Retaining A 1,2;5 as a second basis vector of A 5 (which is independent of A 1,4;5 by the sieve algorithm), we take linear combinations of all the other double derivative expressions to eliminate the G 4 E 3 term, and to obtain combinations which belong to V (7,3) . The further application of ∇ produces the following results for k = 3, 4, ∇ k (A 2,3;5 − 3A 1,2;5 ) ∈ V (5+k,5−k) (6.38) By inspection of its definition in (6.7), the space V (9,1) , which enters above for k = 4, is one-dimensional and generated by ∇ 4 E 5 . However, E 5 is even and thus the left side of each line in (6.38) must vanish for k = 4. Each equation above then states that ∇ 4 A = 0 for the corresponding A. Lemma 1 of [13] implies in each case that A must be constant. Since there are no constant odd functions, A must vanish identically, and we obtain the identities, The differential equation satisfied by A 1,2;5 in the fourth line of (6.37) and by A 1,4;5 in the second line of (6.36) imply the linear independence of these functions. Therefore we conclude that dim A 5 = 2, and we may take A 1,2;5 and A 1,4;5 as a basis.

Speculations on a basis for w ≥ 12
For weight 12, the dimensions of A 12 , A 12 , A 12 are respectively 10, 4, and 3, adding up to 17, one fewer than the result of explicit calculation. The missing subspace may be generated, for example, by the function A 4,7;12 . For weights w > 12, no systematic pattern could yet be proven. However, preliminary checks done up to weight 20 using Mathematica indicate that the following space may be a candidate for the missing subspace for higher weights, where γ and γ max are defined as follows, Functions in this set would be expected to produce holomorphic Eisenstein series either at order ∇ u or ∇ w−v , and it can be shown that only the latter occurs. However, a complete proof of linear independence has remained elusive. Assuming linear independence, the dimension of the space A which would lead to the following full dimension of A w ,

Inner product of modular graph functions
The Petersson inner product f |g of modular functions f, g is defined by [43], where M is the fundamental domain for P SL(2, Z) in the upper half τ -plane H. The Petersson inner product defines the space L 2 (M) of modular functions which are square integrable on M. The Petersson inner product may also be defined for modular forms, but we shall not consider this case here. Clearly, the inner product vanishes when f is an even modular function and g is an odd modular function. Therefore, it suffices to consider the inner product between modular functions which are both even or both odd. In this section, we shall investigate the Petersson inner product involving one-loop and two-loop modular graph functions, and evaluate the product by applying the Rankin-Selberg-Zagier method [44][45][46] to the Poincaré and Fourier series obtained in preceding sections (see also [47] for a useful reference in the physics literature). It will be convenient to consider the cases of even and odd modular graph functions separately. Of considerable use will be the action of the Laplace-Beltrami operator on modular graph functions, which we shall summarize in the next subsection.

The Laplace operator acting on C u,v;w
The Eisenstein series are eigenfunctions of the Laplace operator ∆ = 4τ 2 2 ∂τ ∂ τ on H, The action of the Laplace operator on two-loop modular graph functions was studied extensively in [4] for a special class of even functions. Here we shall need a generalization to the functions C w;u,v which include both even and odd functions and is given by, The indices u, v are integer-valued, but we shall allow w ∈ C, subject to the convergence conditions given earlier.
The Laplace operator ∆ is invariant under parity τ → −τ and (7.3) is invariant under interchange of u and v for fixed w. Therefore, the symmetric and anti-symmetric parts of C u,v;w , respectively denoted S u,v;w ∈ S w and A u,v;w ∈ A w , separately obey (7.3).
The odd two-loop modular graph functions P k (s, t) for k ∈ N and s, t ∈ C defined in (6.26) and expressed in terms of bilinears in derivatives of Eisenstein series in (6.27), satisfy a particularly simple system of Laplace eigenvalue equations given by, The validity of this formula may be verified by direct calculation, and it will be convenient to set P 0 (s, t) = 0. A particularly useful property of the system (7.5) is that it allows us to express P k+1 in terms of a linear combination of ∆P k and P with < k.
Restricting attention to s, t ∈ N, the system (7.5) truncates in the following sense. For 1 ≤ k < t < s, the functions P k (s, t) belong to the space A (1) w , but P t (s, t) is no longer an element of A (1) w because it may be reduced to a combination of holomorphic Eisenstein series. Truncating the system to 1 ≤ k < t < s and treating the function P t (s, t) as an inhomogeneous term, we find the following system of differential equations, The entries of the matrix M are given by (7.5) and its spectrum obeys the theorem below.
Theorem 7.1 The eigenvalues of the matrix M have multiplicity one and are found to be, The theorem is a special case of a result which was proven in Section 5.3 of [14].

Petersson inner product on odd modular graph functions
Odd modular graph functions do not exist at one loop order. The space of odd two-loop modular graph functions is denoted A = w A w and is the direct sum of the spaces A w of functions of weight w. In view of Theorem 6.1 all odd two-loop modular graph functions are cuspidal functions with exponential decay at the cusp so that A ⊂ L 2 (M). The Petersson inner product between any pair of odd modular graph functions is convergent and may be calculated in terms of Poincaré and Fourier series by Rankin-Selberg methods.
In this section we shall investigate the Petersson inner product between odd two-loop modular graph functions and show how the product is evaluated concretely between A u,v;w and P k (s, t). The Poincaré series of A u,v;w (τ ) with respect to Γ ∞ \P SL(2, Z) is given by, where Λ A u,v;w (τ ) = Λ u,v;w (τ )−Λ v,u;w (τ ) and Λ u,v;w (τ ) is given in equation (3.4) of Theorem 3.1. The Fourier series of A u,v;w (τ ) is given in (4.5). Using standard Rankin-Selberg, we have, For w 2 ∈ C, we use equation (3.20) to express the seed function and carry out the integral over τ 1 to obtain the theorem below.
Theorem 7.2 The inner product between two odd modular graph functions A u 1 ,v 1 ;w 1 with Fourier coefficients F and A u 2 ,v 2 ;w 2 with Poincaré series seed Υ, is given by, The integral over τ 2 is absolutely convergent for sufficiently large Re (w 2 ).

The inner product of P with A
The evaluation simplifies for the special case of the odd modular graph functions P k (s, t).
Consider the Petersson inner product of P k (s, t) with A u,v;w given by, The inner product with functions P k (s, t) for k > 1 may be expressed in terms of inner products involving only P 1 (s, t) with the help of the Laplace equations for both functions, and the self-adjointness of the Laplace operator on the space of odd modular graph functions, ∆P k (s, t)|A u,v;w = P k (s, t)|∆A u,v;w (7.12) For any k ≥ 1 and fixed s, t, we abbreviate P k = P k (s, t) and obtain the following recursion relations on the index k, which proves the assertion.
To evaluate the Petersson inner product P 1 (s, t)|A u,v;w we use the expression for P 1 (s, t) in terms of Eisenstein series (6.27). We express the Eisenstein series E s in terms of its Poincaré series and express E t in terms of its Fourier series expansion (2.19). We shall keep s ∈ C but restrict t ∈ N. Finally, we use the fact that A u,v;w is cuspidal and unfold the Poincaré series using standard Rankin-Selberg, 14) The Fourier series decomposition of A u,v;w , given in (4.5), then produces the theorem below.
Theorem 7.3 The inner product of P 1 (s, t) with the odd modular graph function A u,v;w whose Fourier coefficients are F (N ) u,v;w is given as follows, The integral over τ 2 is absolutely convergent for sufficiently large Re (s). Explicit formulas may be obtained in terms of the coefficients W k, ,β u,v;w (N, L), M k, u,v;w (N ), and H k, ,β u,v;w (N ) of the Laurent polynomials which define F (N ) u,v;w using Theorem 5.4. The integral over τ 2 of a term proportional to τ ν 2 in these Laurent polynomials is given by, (7.16) which shows that the sum over N will converge absolutely for Re (s) sufficiently large.

Petersson inner product on even modular graph functions
Even modular graph functions at one-loop order consist of non-holomorphic Eisenstein series E s . The space of even modular graph functions at two-loop order will be denoted S = S w and is the direct sum of the spaces S w of functions of weight w. Even modular graph functions, either at one or two loops, generically grow as positive powers of τ 2 near the cusp, and are not in L 2 (M). Zagier has extended the use of the Rankin-Selberg method to functions of power-growth near the cusp in terms of "renormalized" Petersson integrals [46]. For applications to string theory, however, it is more useful to consider the regularized integrals defined on the cut-off domain M L = M ∩ {τ 2 < L}.

Producing even cuspidal functions from E s and C u,v;w
We begin by defining the operator ∆ k in terms of the Laplace-Beltrami operator ∆ mapping the space of modular functions into itself by, An alternative expression for ∆ k may be obtained in terms of the first order operators, where (m, n) is modular weight. The operator ∆ k satisfies, We have ∆ 1 = ∆, and its action on a monomial τ s 2 is given by, The following lemma follows from the observation that the operator ∆ w annihilates an arbitrary Laurent polynomial in τ 2 of degrees (w, 1 − w).

Lemma 7.4
The modular functions ∆ w (E w 1 E w 2 ) with w 1 + w 2 ≤ w, and ∆ w C u,v;w 1 for w 1 ≤ w are even cuspidal functions.

Calculation of the regularized inner product of E s with C u,v;w
Consider a two-loop modular graph function C u,v;w (τ ) of weight w. Its Laurent polynomial has degree (w, 1 − w). We wish to evaluate the integral, by relating it to the following integral, In view of Lemma 7.4, the function ∆ w C u,v;w is cuspidal and the integral J u,v;w (s) is therefore absolutely convergent for sufficiently large Re (s). The integral J u,v;w (s) is readily evaluated by standard Rankin-Selberg in terms of the constant Fourier mode of C u,v;w , whose Laurent polynomial part cancels out, and we are thus left with, The integral is convergent for sufficiently large Re (s), and we may use the self-adjointness of ∆ w to move ∆ w onto τ s−2 2 to obtain the following final expression, The expression for the Laurent polynomial coefficient functions Q (N ) u,v;w (τ 2 ) of the exponential part of the constant Fourier mode was given in (5.14) of Theorem 5.3.
To work out the relation between the integrals J u,v;w (s, L) and J u,v;w (s) we start from, We use formula (7.19) and carry out successive integrations by parts making sure to collect all the contributions from the boundary of M L at τ 2 = L, and we derive the following relation for two arbitrary modular functions f, g, Substituting f = E s and g = C u,v;w , evaluating ∆ w on E s , and partitioning the integration domain M in J u,v;w into M L and its complement, gives the theorem below.
Theorem 7.5 The regularized inner product integral J u,v;w (s, L) is given in terms of the convergent integral J u,v;w (s) by, Up to corrections of order O(e −4πL ) the second term on the right side may be neglected, while in the remaining sum we may replace E s and C u,v;w by their respective Laurent polynomial parts thereby resulting in a finite sum of powers of L.

Summations over N
The calculation of Petersson inner products for both odd-odd or even-even arrangements of modular graph functions involves infinite-range summations, for which we shall now provide some useful formulas. We begin by recalling the well-known results given in [48], We shall also need sums involving the generalized divisor function V A,B,C (M, N ) defined for A, B, C ∈ Z and M, N ∈ N in (5.11). We shall assume that A + B + C is even, since otherwise the sum vanishes, and we compute by manner of example the following sum which is required in the integration of the constant Fourier mode, We choose Re (s) large enough so that the sum is absolutely convergent. Substituting the definition of V into the summand, we obtain, Both positive and negative m and n contribute to the sum. Denoting by k = gcd(m, n) > 0 the greatest positive common divisor of m and n, we may decompose m, n as follows, Since m and n both divide N , clearly k must divide N , and we write N = kM with M > 0. The summations over k and M are now independent of the summations over µ and ν and may be carried out in terms of the ζ-function, Rescaling µ → m = kµ and ν → n = kν for k ∈ N and then summing over k allows us to recover a simplified sum in m and n without divisor conditions, Since the summand is invariant under (m, n) → (−m, −n) we sum over m > 0 upon including a factor of 2. Furthermore, for fixed m, the sum over n is given by the function S B−1,C (m), which is defined and evaluated in equation in (C.15) of Appendix C.4, Evaluating the sums over m with the help of the formulas given in Appendix C.4, we find, Note that in the first two lines above, the second ζ-factor is an odd zeta-value since the first factor is non-zero only whan j is odd, and by assumption A + B + C − 2 is even.

A Proof of Theorem 5.1
To evaluate the Laurent polynomial L u,v;w and thereby prove Theorem 5.1, we decompose u,v;w for k = 0, 1, 2, 3, 4, so that, To obtain L with w given in (3.4), which produces the first term in (5.4).

A.1 Calculation of L
(1) u,v;w arise from the terms involving L u,v;k since this function has only exponential contributions. The contribution from the function K u,v;k reduces to where Φ (0) u;v+k−1 was given in (5.3). The sum over m may be carried out in terms of even and odd ζ-values, and we obtain, Symmetrization (u ↔ v) applies to the entire expression. The sum over k in the first line may be performed using a variant of Gauss' formula, valid for c ∈ N and a, b ∈ C, and we obtain, where the addition of (u ↔ v) again applies to the entire preceding expression. The first term contributes to 2k−w+1 in (5.5) while the second contributes to 2−w in (5.6).
A.2 Calculation of L The contribution L u,v;w is given by, Carrying out the sum over m in terms of even and odd zeta values gives, The first term contributes to 2k−w+1 in (5.5) while the second contributes to 2−w in (5.6).

A.3 Calculation of L
The contribution L (4) u,v;w arises from the fourth term in Ω of (4.28), as well as from the remaining terms with a = b = c = 1. Collecting these terms up to exponential contributions, sum, we then need m 3 > 0 and set −m 2 = m 1 + m 3 , while in the second sum m 1 and m 2 are interchanged. The sums over m 1 and m 3 in the first term and over m 2 and m 3 in the second term give the multiple zeta values defined in (5.8), This contribution accounts for the entire multiple zeta value part of 2−w in (5.6).

B Proof of Proposition 5.2
We start from the expression obtained for 2−w in Theorem 5.1, and use a key result of [11] that expresses the odd-odd MZVs in terms of even-even MZVs plus a function T which is a bilinear combination of odd zeta values with rational coefficients. For N ≥ 1, we have, Here E n (0) is the Euler polynomial evaluated at zero argument. For N ≥ 1, the function T (M, N ) evaluates as follows, Eliminating all odd-odd MZVs from 2−w using MAPLE for w ≤ 18 and the above formulas, we find that 2−w is given by a bilinear sum of odd zeta values, with integer coefficients λ k , This result proceeds via the cancellation of the MZVs ζ(u + v + k − 2, 2w − u − v − k) for each value of k for which u + v + k is even, obtained by eliminating all odd-odd MZVs using (B.1). The cancellation takes place as if the even-even MZVs were independent variables, even though they do obey the Euler relation, and are thus not necessarily independent. Below we shall exhibit the formulas required for the cancellation separately for u + v even or odd.
For u + v = 2z even, the contributions with even-even MZVs are obtained from the even k contributions in (5.5) and are given by, while the contributions from eliminating odd-odd MZVs are given by, Recognizing the contribution X e u,v;w as being the same as the = 0 part of X T would be, we see that the cancellation term-by-term in k of the coefficients of the even-even MZVs is equivalent to the cancellation of the following sums, with Y u,v;w,k given by, The constraint arising from the Heaviside θ-function is automatically satisfied in view of the first Γ-function in the denominator. We have checked using MAPLE that Y u,v;w,k vanishes for all w ≤ 52 with 1 ≤ u ≤ w − 2, 2 ≤ v ≤ u, and 1 ≤ k ≤ w − z − 1. An analytical proof of the vanishing of Y u,v;w,l is an open problem, as was the case with its analogue in [11]. It remains to analyze the case of N = 0, for which we have This contains only bilinears in odd zeta values and terms which belong to π 2w−2 Q. The sum of all terms proportional to π 2w−2 Q in 2−w are known to cancel by the generalization of Theorem 1.2 of [11], and they were verified to vanish by MAPLE. The remaining terms are then all bilinear in odd zeta values and arise from the second term on the first line of (B.1), the first line of contributions to T in (B.2), and from the term on the second line of (B.9). The coefficients λ k are then found to be given by the formula in Proposition 5.2 for u + v even. A corresponding calculation establishes Proposition 5.2 for u + v odd.

C Calculation of exponential contributions
In this section, we shall evaluate the contributions which are exponentially suppressed near the cusp. The key formulas separating the exponential contributions in ϕ k and Φ a;b are given in (5.1) and (5.3). There are no exponential contributions arising from C (0) u,v;w . The exponential contribution arising from C (i) u,v;w will be denoted by E (i) u,v;w for i = 1, 2, 3, 4.

C.1 Calculation of E
(1) The exponential contributions E (1) u,v;w +E (2) u,v;w arising from the combination C (1) u,v;w +C (2) u,v;w given in (4.17) take the following form, The contribution E (K) u,v;w;k arises from the term involving K u,v;k , which was evaluated in (4.14), and may be decomposed as follows, where we have defined The contribution E (L) u,v;w;k arises from the term involving L u,v;k which was evaluated in (4.16), and is given as follows, The exponential contribution E u,v;w arising from C u,v;w given in (4.19) takes the form, where we have defined u,v;w is given by, where Ω was given in (4.28). The sum over the m-variables is carried out by partitioning the contributions according to the decomposition of the ϕ-functions. The terms with two Kronecker δ-symbols have already been counted towards the Laurent series.
The contributions with a single Kronecker δ require the following sums, These contributions are all harmonic in q. Each function vanishes by m r → −m r symmetry of the summation unless the sum of all four of its arguments is even, so for example in Σ In terms of these functions, we have, where we have the following expressions for j = 0, 1,

C.4 Harmonic sums and single-valued zeta-values
The functions Σ (i) 1 for i = 2, 3, 4 may be evaluated in terms of harmonic sums, sums over harmonic sums, and single-valued zeta-values, which we shall briefly discuss first. The basic harmonic sum H n (m) satisfies the following relations, as well as H n (0) = 0 and H n (∞) = ζ(n). The double zeta-value ζ(k, n) may be expressed in terms of the following sum over harmonic sums, The single-valued ζ-values were introduced in [22], and may be defined as follows, ζ sv (n) = 2ζ(n) n ∈ 2N + 1 0 otherwise (C.14) As we shall see below, they arise very naturally in the exponential part of C u,v;w . We may apply these definitions to evaluating the ubiquitous sum defined by, Partial fraction decomposition in n and summation over n, using the sums, gives the following result, To compute the sum of the term proportional to δ a,1 in the summand of Σ (2) 1 (B, C; a, b), given in (C.8), we use m r → −m r symmetry to choose m = m 2 > 0, so that the term becomes, The sum over m 1 may be carried out in terms of the function S 0,C (m 2 ) defined in (C.17), and upon setting N = pm and eliminating the sum over p in favor of a sum over N , we find, For given N , the sum is over a finite number of values of m. For each value of m, the contribution is a sum of a rational number and a rational number times an odd zeta-value.
To compute the sum of the term proportional to δ b,1 in the summand of Σ 1 (B, C; a, b), we use m r → −m r symmetry to choose m = m 1 > 0, so that this term becomes, The sum over m 2 may be carried out in terms of S B,C (m) and putting all together, we find, The computation of Σ while the computation of Σ  To calculate Σ Changing variables from (p 1 , p 2 ) to (N 1 , N 2 ) with N 1 = p 1 |m 1 |, N 2 = p 2 |m 2 |, and we find, where T B,b (q) is given by, This quantity vanishes unless B + b is even, in which case it may be simplified as follows, The last sum may be evaluated by expandingφ k using (5.3) and changing summation variables from p 1 , p 2 to to N 1 = p 2 m 2 and N 2 = p 1 m 2 . Putting all together, we find, Choosing independent variables m 1 , m 3 and expanding theφ-functions, Change variables from p 1 , p 2 to N 1 = p 1 |m 1 | and N 2 = p 2 |m 3 |, For i = 2 we use Σ For i = 3 we use Σ For i = 4 we use Σ u,v;w,k for i = 2, 3, 4 For i = 2 we use Σ For i = 4 we use Σ

D Fourier coefficients of exponential contributions
In this appendix, we shall use the results of Section 4 and Appendix C to compute explicitly the exponential contributions to the two-loop modular graph functions C u,v;w considered in this paper. We begin with the calculation of the exponential contributions to the constant Fourier mode in subsection D.1 and then proceed to evaluating the non-constant Fourier modes in subsections D.2 and D.3.

D.1 Calculation of Q
We begin by obtaining the exponential part of the constant Fourier mode Q while the contribution from C u,v;w is given by, The contribution from C (4) u,v;w arises only from R (i,0) u,v;w,k for i = 2, 3 and is given by, u,v;w (τ 2 ), defined in (4.1), is given by, We may now simplify this as follows. In the first term of (D.4), the summations over k, β may be interchanged and, introducing the function the first line becomes, Likewise in the third term of (D.4), we may change variables from b to β = a + b − 1, and introduce the function, The third line then becomes, In the fourth term we change variables from b to β = b + c − 1, and introduce the function, The fourth term then becomes, Assembling all the pieces gives the result quoted in (5.14).

D.2 Calculation of G
We now obtain the coefficients G u,v;w is given by, The contribution from C u,v;w is given by, The contributions from C u,v;w arise from R (i,0) u,v;w,k for i = 2, 3 and are given respectively by, (D.14) The total result can be written in an abridged form as follows, To express the coefficients W k, ,β u,v;w (N, L) in a form as simple as possible, we shall adopt the convention whereby binomial and trinomial coefficients vanish if any one of their lower entries is a negative integer, for any i = 1, · · · , r, or if −A ∈ N. For all integer arguments/indices, the coefficients W k, ,β u,v;w (N, L) are rational numbers. They are given by the following lengthy expression, where we have defined u,v;w + C (2) u,v;w is given by, Note that (u ↔ ) applies only to the portion in brackets on the penultimate line.
The contribution from C The contributions from C (4) u,v;w come from R (i,1) u,v;w,k for i = 2, 3, 4, as well as from R (4,0) u,v;w,k . They can be written collectively as where k − , k + , and + are as defined in (D. 16) and Note that we are utilizing the convention put forth in (D.17). The µ (i) k, u,v;w (N ) for i = 1, 2, 3 are defined by, We have also defined where again we are using the convention of (D.17).
The coefficients M k, u,v;w (N ) evaluated on integer-valued indices and arguments are linear combinations of rational numbers and rational multiples of odd zeta values. Odd zeta values naively appear in all µ (i) k, u,v;w (N ) for i = 1, 2, 3. However, there are actually no odd zeta values arising from µ (3) k, u,v;w (N ), since the factor of ζ sv (2w − k) appearing in (D.24) cancels against the zeta value arising from the definition of S 0,2w−k (m), see (C.17). Hence we obtain contributions from only the first two lines of (D.24), which are given by Once again, we are working with the convention of (D.17).
Finally, we find, E Proof of Theorem 6.3 In this appendix we prove Theorem 6.3. To do so we proceed in two parts. We first prove the linear independence of the spaces A (1) w and A (2) w , and then move on to the more complicated case of A (3) w . Both parts are proven by means of holomorphic subgraph reduction and the sieve algorithm.
E.1 Independence of A (1) w and A (2) w and then apply ∇ to it. Since A w ⊂ V (w,w) , we have Applying ∇ to (E.5) produces only elements of V (w+1,w−1) , except for when it acts on P w 2 −1 (w − w 2 , w 2 ), in which case it produces By the sieve algorithm, all terms not in V (w+1,w−1) must cancel, so (E.5) requires the above to vanish. The form ∇ w 2 E w 2 is proportional to G 2w 2 by (2.21) so that all the terms for different values of w 2 must be linearly independent of one another, and we must have α(w 2 , w 2 −1) = 0 for all 2 ≤ w 2 ≤ [ w−1 2 ]. Given these cancellations, the range of the sum over k in (E.5) now effectively has upper limit w 2 − 2. By construction, for these values of k and w 2 , the image of ∇ on each term in (E.5) belongs to V (w+1,w−1) , and we may now proceed to ∇ 2 , In addition to the contributions coming from P w 2 −2 (w − w 2 , w 2 ), there will now be a contribution towards C (w+2,w−2) coming from an element of A (2) w as well. In particular, the image of ∇ 2 on each term of the abridged (E.5) is in V (w+2,w−2) , except for the images of P w 2 −2 (w − w 2 , w 2 ) and A 1,2;w , which have, For simplicity, we have absorbed unimportant factors of Gamma functions and τ 2 into α(w 2 , w 2 − 2) and β (1). For this expression to vanish, we require α(w 2 , w 2 − 2) = β(1) = 0.
Having eliminated the elements of C (w+2,w−2) , one may then move on to order ∇ 3 . Iterating this argument, one inductively shows that all coefficients must vanish, and thus that all elements of A w and A (2) w are independent.

E.2 Independence of
w , and A (2) w We shall now prove the linear independence of A w analogously to the case of A w . The additional complication is that the holomorphic Eisenstein series which arise do so via holomorphic subgraph reduction in addition to algebraic reduction. In particular, note that for any A u,u+1;w ∈ A (3) w , by definition w − u − 1 ≤ u + 1. Restricting temporarily to the case u = w−1 2 , it follows that w − u − 1 is the lowest element in the exponent matrix, and hence, w (E. 10) or equivalently The elements of C (2w−u−1,u+1) arise via holomorphic subgraph reduction, and are computed in closed form in Lemma F.1 of Appendix F, which yields when v = u + 1. C + is defined by, The ellipsis in (E.12) represent elements of V (2w−u−1,u+1) , while the functions H 1 ( ), H 2 ( ), and C + are obtained from (F.12) and (F.3) by setting v = u + 1, Importantly, we have noted that u ≤ w −5 in the definition of A w implies that w −u−1 ≥ 4, and then we have used (E.14) to obtain the lower bounds on the sums in (E.12). Each individual term in the remaining sums has non-vanishing coefficient.
We reemphasize that these are only the contribution arising from holomorphic subgraph reduction. As long as u = w−1 2 , this is in fact all of the contributions. However, for u = w−1 2 one would expect an additional holomorphic Eisenstein series G w produced via algebraic reduction. For w odd this term is vanishing and the distinction is unimportant, whereas for w even we must take it into account. For w ∈ 4N, the case of u = w 2 is also exceptional, since (E.12) vanishes. For the moment, we take u > w We now focus on the terms in (E.12) with the holomorphic Eisenstein series of lowest weight. We may begin by assuming that w − u ∈ 2N + 1. If this is the case, then (E.12) has a term containing a holomorphic Eisenstein series G w−u+1 with coefficient which is non-vanishing. Hence the lowest weight holomorphic Eisenstein series is G w−u+1 .
In the case of w − u ∈ 2N, one begins by considering the case = w − u, to which both sums contribute. However, in this case H 1 (w − u) + H 2 (w − u) vanishes. Thus one moves on to = w − u + 2. There is always a contribution towards this term from the second sum in (E.12), since u ≤ w − 5 implies that 2(w − u) − 1 ≥ w − u + 4. If the first sum does not contribute to this term, then the coefficient is automatically non-vanishing. If the first sum does contribute, one finds which is non-vanishing for u > w 2 . Thus the lowest weight holomorphic Eisenstein series produced is G w−u+2 .
With this information, we may now begin to prove linear independence of A (1) w , A w , and A (3) w . This is done in the same manner as before: we begin by writing a tentative linear combination, now including the additional contributions due to elements of A At any order n < 4 in ∇, the elements of A w do not give rise to elements of C (w+n,w−n) , and one may proceed exactly as in the first part of the proof. On the other hand, at each order 4 ≤ n < w−1 2 in ∇ there is a single element of A (3) w which is in V (n) (w,w) , namely A w−n−1,w−n;w . 3 By the reasoning of the previous paragraphs, this function produces elements of C (w+n,w−n) which include terms proportional to G n+2 (n even) or G n+3 (n odd). At the same order ∇ n , only P w 2 −n (w − w 2 , w 2 ) ∈ A (1) w and A n−1,n;w ∈ A (2) w contribute elements of C (w+n,w−n) . Since the former requires w 2 ≥ n + 1, the lowest weight holomorphic Eisenstein series which it can produce is G 2(n+1) , while the latter contributes only a term containing G 2n . Because n ≥ 4, these are necessarily of higher weight than G n+2 or G n+3 , thus proving linear independence for all functions in V (n) (w,w) for n < w−1 2 . 3 The upper bound on n is equivalent to the earlier bound u > w 2 .
We now turn to the remaining cases of n = w−1 2 and, if w is even, n = w 2 . In fact, as mentioned before it is only when w is even that exceptional phenomena occur, and hence we focus on the case of w even for the remainder of the proof. We consider separately the cases of w / ∈ 4N and w ∈ 4N. If w / ∈ 4N, the result (E.12) for n = w−1

F Holomorphic subgraph reduction
We begin with the following lemma.
Lemma F.1 For 1 ≤ u < v ≤ w − 1 and w − v < u, the lowest order ∇-derivative on A u,v;w which yields a holomorphic subgraph is ∇ w−v , with the contribution from holomorphic subgraph reduction given by, The ellipsis represents terms in V (2w−v,v) and the functions H i ( ) are given by, We have used the following abbreviation, To prove this, we begin by noting that the conditions 1 ≤ u < v ≤ w − 1 and w − v < u imply w − v < w − u and w − v < v. Hence w − v is the smallest non-zero exponent in the modular graph function A u,v;w and as such ∇ n A u,v;w ∈ V (w+n,w−n) for all n < w − v. The first possible appearance of a holomorphic subgraph is at n = w − v.
The holomorphic subgraph reduction contribution to the derivative ∇ w−v A u,v;w arises solely from the first term in (6.1). Focusing on this term, repeated use of (6.9) gives where the ellipses represents terms in V (2w−v,v) . The only holomorphic subgraph contribution arises from the following rearrangement using the momentum conservation identities (2.4), which in turn may be evaluated using the holomorphic subgraph reduction formula of (6.10). The second line of (6.10) does not contribute, since the first term does not yield a holomorphic subgraph and the part in brackets cancels. Putting the pieces together, we find, where the ellipses represents terms in V (2w−v,v) and the functions h i (m, ) are given by, Next, we interchange the summation over m and in (F.6) to obtain The sums over m are proportional to hypergeometric functions evaluated at unit argument and may be evaluated using Gauss's formula, Having proven Lemma F.1, we have the following simple corollary,

G A special case
As discussed after Corollary F.2, for w ∈ 4N, u = w 2 , and v = u + 1 all elements of C (2w−v,v) cancel from the right-hand side of (F.1). In this case the sieve algorithm demands that we proceed to the next order in ∇, i.e. ∇ w−v+1 = ∇ w 2 , to obtain the first holomorphic Eisenstein series. In other words, A w 2 , w 2 +1;w ∈ V (w/2) (w,w) for w ∈ 4N. Obtaining the elements of C (3w/2,w/2) explicitly in this case is more involved than in Appendix F, but follows the same strategy.
We consider A u,v;w = C u,v;w − C v,u;w and focus on the first term on the right-hand side. In order to identify all elements of C (3w/2,w/2) , at each order in ∇ it no longer suffices to keep only the terms with the smallest lower right entry in the exponent matrix. Instead, we must also keep terms with next-to-smallest lower right entry, since these may still produce holomorphic Eisenstein series after the remaining ∇ are applied. The terms with next-tosmallest lower right entry at level ∇ s arise from terms with smallest lower right entry at order ∇ s−1 . In particular, from (F.4) and (F.5) we see that the terms with smallest lower right entry at order ∇ s−1 are The terms of next-to-smallest lower right entry at order ∇ s are then obtained by applying ∇ to the above and keeping only the terms which, via momentum conservation identities, subtract 1 from the bottom center entry of the exponent matrix, producing the modular graph form, where we have neglected terms which do not have next-to-smallest lower right entry. Then in order to identify the elements of C (w+n,w−n) produced by these functions at order ∇ n , we may consider only the terms for which, upon application of ∇, the value of the lower right entry is reduced (i.e. we may neglect any functions which have further subtractions on the bottom center entry, since such terms cannot produce any holomorphic Eisenstein series at order ∇ n ). In particular, by the same reasoning as for (F.4), it follows that are the terms which must be kept. Hence the elements of C (w+n,w−n) coming from functions which experienced the single subtraction on their bottom center entry at order ∇ s can be obtained by considering the elements of C (w+n,w−n) produced by Finally, in order to capture all holomorphic Eisenstein series arising in this way, we must sum over all s in the range 1 ≤ s ≤ n − 1. Specifying that n = w − v + 1, w ∈ 4Z, u = w/2 and v = u + 1, the complete set of elements of C (3w/2,w/2) are contained in where we have defined g 1 (s, m, r, ) = 3w/2 − − 1 w − m − r − g(s, m, r, ) g 2 (s, m, r, ) = 3w/2 − − 1 w/2 + m + r − g(s, m, r, ) (G.8) This is the contribution towards C (3w/2,w/2) at order ∇ w/2 coming from C w 2 , w 2 +1;w in, A w 2 , w 2 +1;w = C w 2 , w 2 +1;w − C w 2 +1, w 2 ;w (G.9) When calculating the total contribution to C (3w/2,w/2) from the full odd modular graph function, we must also consider contributions coming from C w 2 +1, w 2 ;w . These include elements of C (3w/2,w/2) coming from algebraic subgraph reduction, as well as from holomorphic subgraph reduction since u = w 2 . The terms arising from algebraic subgraph reduction are found to be of the form ∇ w/2 C w 2 +1, w 2 ;w alg.red.