1. Introduction
The characteristic polynomials of random matrices have received considerable attention over the past 20 years. One of the principal motivations stems from their connections to the statistical properties of the Riemann zeta-function and other families of L-functions [Reference Keating and Snaith37, Reference Keating and Snaith36, Reference Hughes, Keating and O’Connell33, Reference Conrey and Gonek15, Reference Conrey, Farmer, Keating, Rubinstein and Snaith13, Reference Conrey, Farmer, Keating, Rubinstein and Snaith14, Reference Keating and Snaith35, Reference Fyodorov, Hiary and Keating25, Reference Fyodorov and Keating27]. In this context, the value distributions of the characteristic polynomials of random unitary, orthogonal and symplectic matrices have been calculated using a variety of approaches. For example, the moments have been computed in all three cases and the results used to develop conjectures for the moments of the Riemann zeta-function $\zeta(s)$ on its critical line and for the moments of families of L-functions at the centre of the critical strip. Specifically, if A is an $N\times N$ unitary matrix, drawn at random uniformly with respect to Haar measure on the unitary group U(N), then for $\textrm{Re}\beta>-1/2$
from which one can deduce that as $N\to\infty$
where G(s) is the Barnes G-function, and for $k\in\mathbb{N}$
These formulae lead to the conjectures [Reference Keating and Snaith37] that for $\textrm{Re}\beta>-1/2$ , as $T\rightarrow\infty$
and for $k\in\mathbb{N}$ , as $T\rightarrow\infty$
where
with the product running over primes p.
Our focus here will primarily be on the Gaussian Unitary Ensemble (GUE) of random complex Hermitian matrices. For an $N\times N$ matrix M drawn from the GUE, the joint eigenvalue density function is
where ${\mathscr{Z}_N^{\,(H)}}$ is a normalisation constant. When t is fixed, Brezin and Hikami [Reference Brézin and Hikami9] calculated the $N\to\infty$ asymptotics of the moments of the associated characteristic polynomials to be
where the asymptotic eigenvalue density is given by the Wigner semi-circle law
This corresponds precisely to (1.3), where the mean density is constant.
Our purpose is to investigate the series expansion in powers of t for the moments of the characteristic polynomials of GUE matrices, and of matrices drawn from other unitarily invariant ensembles, when appropriately scaled. We obtain a general formula for the coefficients, which are polynomials in N. They depend strongly on whether N is odd or even and diverge when N grows, meaning that the series expansion has a radius of convergence which shrinks. This is related to increasingly rapid oscillations in t when N grows. When $t=0$ , as $N\to\infty$ we recover the asymptotic formula predicted by (1.8). When $t\ne0$ , the series expansion cannot be used straightforwardly to compute the asymptotics of the moments, because of the non-uniform convergence. However, we observe a surprising cancellation when we average formally over consecutive values of N: this procedure leads to an exact cancellation in the parts of the expansion coefficients that diverge when $N\to\infty$ , leaving precisely the values consistent with (1.8). Drawing attention to this observation is our main purpose.
Brezin and Hikami [Reference Brézin and Hikami9] used orthogonal polynomial techniques to arrive at (1.8). Other studies to-date relating to the asymptotics of the moments of characteristic polynomials have relied mainly on the orthogonal polynomial method and saddle point techniques [Reference Brézin and Hikami9, Reference Brézin and Hikami10, Reference Baik, Deift and Strahov3], the Riemann–Hilbert method [Reference Strahov and Fyodorov44], Hankel determinants with Fisher–Hartwig symbols [Reference Krasovsky38, Reference Forrester and Frankel18, Reference Garoni32] and supersymmetric representations [Reference Andreev and Simons2, Reference Fyodorov and Strahov30, Reference Fyodorov23, Reference Szabo45]. In the present study, we take a different approach: we express the moments in terms of certain multivariate orthogonal polynomials and take a combinatorial approach to compute the asymptotics of the moments using the properties of these polynomials. By doing so, we discover that even and odd dimensional GUE matrices give different contributions in the large N limit, and that only a formal average gives formulae consistent with (1.8). In Section 3.2.1, this phenomenon is discussed in detail for the second moment of the characteristic polynomial.
In addition to connections with number theory, characteristic polynomials have found numerous applications in quantum chaos [Reference Andreev and Simons2], mesoscopic systems [Reference Fyodorov and Quantum Physics22], quantum chromodynamics [Reference Damgaard and Nishigaki16], and in a variety of combinatorial problems [Reference Strahov43, Reference Diaconis and Gamburd17]. The asymptotic study of negative moments and ratios of characteristic polynomials is another active area of research, see for example [Reference Berry and Keating6, Reference Fyodorov and Keating26, Reference Fyodorov and Strahov31, Reference Baik, Deift and Strahov3, Reference Strahov and Fyodorov44, Reference Forrester and Keating19, Reference Borodin and Strahov7, Reference Breuer and Strahov8, Reference Fyodorov, Grela and Strahov24, Reference Akemann, Strahov and Würfel1]. More recently, the statistics of the maximum of the characteristic polynomial are being extensively studied, motivated by the relations to logarithmically correlated Gaussian processes. For example, see [Reference Fyodorov, Hiary and Keating25, Reference Fyodorov and Keating27, Reference Fyodorov and Le Doussal28, Reference Fyodorov and Simm29] and references therein. We expect that the techniques developed here will have applications to those calculations as well.
This paper is structured as follows. In Section 2, we review the background results we shall need and discuss exact formulae for the moments of characteristic polynomials. In Section 3, we investigate these formulae fin the GUE case asymptotically, when the matrix size tends to infinity. In the last section, Section 4, as an application of our results, we compute the correlations of secular coefficients, which are the coefficients of a characteristic polynomial when expanded as a function of the spectral variable.
2. Background
A partition $\mu$ is a sequence of integers $(\mu_1,\dots,\mu_l)$ such that $\mu_1\geq\dots\geq\mu_l>0$ . Here l is the length of the partition and we denote $|\mu|=\mu_1+\dots+\mu_l$ to be the weight of the partition. We do not distinguish partitions that only differ by a sequence of zeros at the end. A partition can be represented with a Young diagram which is a left adjusted table of $|\mu|$ boxes and $l(\mu)$ rows such that the first row contains $\mu_1$ boxes, the second row contains $\mu_2$ boxes and so on. The conjugate partition $\mu^\prime$ is defined by transposing the Young diagram of $\mu$ along the main diagonal.
For a partition $\mu$ , let $\varPhi_\mu$ be the multivariate symmetric polynomial, with leading coefficient equal to 1, that obey the orthogonality relation
for a weight function w(x). Here, the lengths of the partitions $\mu$ and $\nu$ are less than or equal to the number of variables n, and $C_\mu$ is a constant which depends on n. Polynomial $\varPhi_\mu$ can be expressed as a ratio of determinants, as given in [Reference Sergeev and Veselov42],
where $\varphi_j(x)$ is a monic polynomial of degree j orthogonal with respect to w(x). We focus in particular to the case when w(x) in (2.1) is one of the following weights
Note that the Gaussian and Laguerre weights are rescaled with a parameter N which we later take to infinity.
When $\varphi_n(x)$ in (2.2) is chosen to be one of the monic Hermite, Laguerre and Jacobi polynomials of degree n, we get their multivariable analogues denoted by $\mathscr{H}_\mu$ , $\mathscr{L}^{(\gamma)}_\mu$ and $\mathscr{J}^{(\gamma_1,\gamma_2)}_\mu$ . These multivariate generalisations are the eigenfunctions of differential equations called Calogero–Sutherland Hamiltonians. Several properties such as recursive relations and integration formulas extend to the multivariate case [Reference Baker and Forrester4, Reference Baker and Forrester5].
The Schur polynomials $S_\lambda$ , indexed by a partition $\lambda$ , are defined as
for $l(\lambda)\leq n$ , and $S_\lambda=0$ for $l(\lambda)>n$ . The polynomials $\mathscr{H}_\mu$ , $\mathscr{L}^{\,(\gamma)}_\mu$ and $\mathscr{J}^{\,(\gamma_1,\gamma_2)}_\mu$ form a basis for symmetric polynomials of degree $|\mu|$ . Therefore, Schur polynomials can be expanded as [Reference Jonnadula, Keating and Mezzadri34]
where $\varPhi_\nu(\textbf{x})$ can be either $\mathscr{H}_\nu$ , $\mathscr{L}^{\,(\gamma)}_\nu$ , or $\mathscr{J}^{\,(\gamma_1,\gamma_2)}_\nu$ . In the following the superscripts (H), (L) and (J) indicate Hermite, Laguerre and Jacobi, respectively. The coefficients in (2.5) are
where
and
Similarly, when $\varPhi_\lambda$ is one of the $\mathscr{H}_\lambda$ , $\mathscr{L}^{\,(\gamma)}_\lambda$ , $\mathscr{J}^{\,(\gamma_1,\gamma_2)}_\lambda$ , the Schur expansion is
with
and
The coefficients $\Psi_{\lambda\mu}$ and $\Upsilon_{\lambda\mu}$ are nothing but the determinants $\det(a_{\lambda_j+n-j,\mu_k+n-k})$ and $\det(b_{\lambda_j+n-j,\mu_k+n-k})$ where $a_{j,k}$ and $b_{j,k}$ are the coefficients that appear when the monomial is expanded in the univariate polynomial basis and vice-versa, respectively. Coefficients $\Psi_{\lambda\mu}$ and $\Phi_{\lambda\mu}$ differ slightly from [Reference Jonnadula, Keating and Mezzadri34] since we used monic polynomials in the definition (2.2). In this paper, the above results play an important role in studying the correlations of characteristic polynomials and secular coefficients.
2.1 Moments of characteristic polynomials
Analogous to the Dual Cauchy identity satisfied by the Schur polynomials, which plays a crucial role in computing the correlations of characteristic polynomials of the unitary group, the multivariate polynomials satisfy the following identity.
Lemma 2.1 (Generalised dual Cauchy identity). Let $k,N\in\mathbb{N}$ . For $\lambda\subseteq (N^k)\equiv (\underbrace{N,\dots,N}_{k})$ , let $\tilde{\lambda}=(k-\lambda_N^\prime,\dots,k-\lambda_1^\prime)$ . Then
Here $\lambda=(\lambda_1,\dots,\lambda_k)$ is a sub-partition of $(N^k)$ indicated by $\lambda\subseteq (N^k)$ (each $\lambda_j\leq N$ for $j=1,\dots, k$ ) and $\lambda^\prime$ is the conjugate partition of $\lambda$ . As the polynomials $\varPhi_\lambda$ are orthogonal with respect to the joint eigenvalue density of Hermitian ensembles,
(2.18) gives a compact way to calculate the correlation functions and moments of characteristic polynomials of unitary invariant Hermitian ensembles.
Proposition 2.1 Let M be an $N\times N$ GUE, LUE or JUE matrix and $t_1,\dots, t_k\in\mathbb{C}$ . Then, using the generalised dual Cauchy identity [Reference Jonnadula, Keating and Mezzadri34],
The moments can be readily computed from the above formulae by taking the limit $t_j\rightarrow t$ for $j=1,\dots ,k$ . This leads to a determinantal formula for the moments involving the derivatives of orthogonal polynomials. Alternatively, using the expansions equations (2.14), (2.15), (2.16) and the relations
where the dimension of the irreducible representation of the symmetric group is
one can compute the moments of the characteristic polynomials.
Proposition 2.2. Let $\lambda=(N^{k})$ . The moments of characteristic polynomial are given by [Reference Jonnadula, Keating and Mezzadri34]
These results give an expansion in powers of the spectral parameter t for a fixed N. Equations (2.25), (2.26), (2.27) can also be interpreted as a formal power series in the variable t for small t. In the next section, we perform explicit calculations to investigate the N-dependence of the coefficients and the convergence properties of the sum.
3. Asymptotics
In this section, we consider the asymptotics of the moments of characteristic polynomials, appropriately scaled, for the GUE. By exploiting the integral representation of the classical Hermite polynomials, Brezin and Hikami [Reference Brézin and Hikami9] showed that the moments of characteristic polynomials satisfy
as $N\to\infty$ with t fixed, where the asymptotic eigenvalue density is
Using (2.25), we show in Section 3.1 that
which coincides with (3.1) for $t=0$ . For $t\neq 0$ , the radius of convergence of the series expansion of the moments, scaled to compare with (3.1) shrinks when $N\to\infty$ and the expansion cannot be used straightforwardly to compute the asymptotics. Moreover, the formula is different for even and odd dimensional GUE matrices. However, we observe that when one averages over consecutive even and odd dimensions, the divergent N-dependence of the coefficients cancels, leaving terms that do coincide with the expansion of $\rho_{sc}(x)$ . These cases are discussed in Sections 3.1 and 3.2 in more detail.
3.1 Centre of the semi-circle
Let $\lambda=(N^{2k})$ . For any finite N, we have
Proposition 3.1.
Proof. The determinant $D^{(H)}_{\lambda 0}$ can be evaluated as follows. Let $N=2m$ , then
Perform the row operations $R_{2j}=R_{2j}-R_{2j-2}$ , $R_{2j-1}=R_{2j-1}-R_{2j-3}$ with j running from $k,k-1,\dots,2$ in that order. Using the Pascal’s rule for binomial coefficients, we get
Next perform $R_{2j}=R_{2j}-R_{2j-2}$ , $R_{2j-1}=R_{2j-1}-R_{2j-3}$ with j running from $k,k-1,\dots,3$ in that order. Repeat this process $k-2$ more times to reach an upper triangular matrix with determinant given in (3.5). Similarly, $D^{(H)}_{\lambda 0} $ can be calculated for N odd.
Define
Using this notation, (3.4) reads
The functions $C_\lambda(2k) D_e(N)$ and $C_\lambda(2k) D_o(N)$ , $\lambda=(N^{2k})$ , can be expressed in terms of the ratios of factorials,
Denote
The universal constant $\gamma_k$ is present in the moments for any finite N. To compute the large N limit, we require the asymptotic expansion of (3.10). In Appendix A, we compute the first few terms in this expansion. As $N\rightarrow\infty$ ,
Plugging (3.12) in (3.9), the leading order behaviour of the moments for N even and N odd is
which coincides with (3.1) for $t=0$ . On the other hand, the sub-leading behaviour depends on the parity of N.
3.2 Away from the centre of the semi-circle
Recall that
To compute the asymptotics near the centre of the semi-circle, $t\neq 0$ , we need to evaluate $D^{(H)}_{\lambda\nu}$ for a non-empty partition $\nu$ . In Table. 1, we give the values of $D^{(H)}_{\lambda\nu}$ when $\nu$ is a partition of 2 and 4.
Therefore,
where $\text{poly}_{j}(N,k)$ denotes a polynomial of degree j in the variables N, k, and the explicit expressions are given in Table 1 for $j\leq 4$ . By referring to (3.10), it is interesting to see that the universal constant $\gamma_k$ is a factor of the moments for any finite N. The first few terms in the moments of characteristic polynomials are
Up to a factor of $(\!-1)^k$ , both $C_\lambda D_e$ and $C_\lambda D_o$ have the same leading term,
but they differ at sub-leading order as shown in (3.12). In Appendix A, we give the expansion of $C_\lambda(N)D_e$ and $C_\lambda(N)D_o$ up to $O(N^{-6})$ . Note that the fact that the coefficients are polynomial functions of N means that the radius of convergence of the expansion shrinks as $N\to\infty$ . This means that for $t\ne 0$ we cannot use this expansion straightforwardly to determine the large-N asymptotics.
3.2.1 Second moment
The correlations of characteristic polynomials are connected to the correlation functions of random matrices [Reference Mehta40, Reference Forrester20, Reference Mezzadri, Snaith and Hitchin41]. In particular,
where $R^{(N)}_1$ is the one-point density of eigenvalues of matrix size N. As the second moment of the characteristic polynomial is related to the density of states, it is natural to expect the semi-circle law in the limit $N\rightarrow\infty$ as given in (3.1) for a fixed t inside the support of the spectrum. Re-writing (3.1) for $k=1$ ,
which as an expansion in t reads
We now make an observation that we consider surprising: for $k=1$ , starting with (3.14) there is a formal procedure that leads to (3.20). Inserting the asymptotics of $C_\lambda D_e$ and $C_\lambda D_o$ in (3.16), one obtains
Treating the above expansions as a formal series in N and taking their average gives (3.20). In Appendix B, it is shown that the average over even and odd N coincides with the semi-circle law up to $O(t^{10})$ . Also, a general expression for the coefficient of $t^{2j}$ in (3.14) is given for $k=1$ .
Remark 1. For a fixed j, notice that the leading order terms in the coefficients of $t^{2j}$ , which depend on N, differ only by a sign for N even and odd. Therefore, after a formal average of both the series in (3.21), the coefficient of $t^{2j}$ is equal to $c_{2j}+O(N^{-1})$ . The constant $c_{2j}$ turns out to be the appropriate coefficient of $t^{2j}$ in the semi-circle law.
Remark 2. The behaviour exhibited by (3.21) can be understood by considering Figure 1. For a fixed N, the plot shows the behaviour of
as a function of t. The function f(N,t) is oscillatory. The magnitude of the oscillations decreases as N increases, but their length-scale decreases. Moreover, the peaks and troughs of f(N,t) for N even coincides with the troughs and peaks of N odd, respectively. For a fixed j, this explains the divergent polynomial part of N in the coefficients of $t^{2j}$ and the sign change of leading order terms in the N even and odd cases. Formally averaging the two series of f(N,t) when N is even and odd cancels out these oscillations and leaves a result that converges to the semi-circle law.
Remark 3. As discussed, the size of oscillations in f(N,t) decreases as N increases. Therefore, f(N,t) converges to the semi-circle law as $N\to\infty$ independent of whether N is even or odd. But, at finite but large N, the average of f(N,t) between two consecutive integers is a significantly smoother approximation to the semi-circle law.
3.2.2 Higher moments
For higher moments, the correlations of characteristic polynomials are related to the correlation functions of eigenvalues as
where $R^{(N)}_k(t_1,\dots,t_k)$ denotes a $k-$ point correlation function of a GUE matrix of size N. The correlations of characteristic polynomials of matrices of size $N-k$ are related to the correlation functions of eigenvalues of matrices of size N. The Dyson sine-kernel for the $k-$ point correlation function and (3.1) for the moments of characteristic polynomials are recovered in the Dyson limit: $t_i-t_j\rightarrow 0$ , $N\rightarrow\infty$ and $N(t_i-t_j)$ is kept finite when $|t_j|<2$ , $j=1,\dots,k$ .
In terms of the Schur polynomials, $\lambda=(N^{2k})$ ,
Computing the asymptotics of moments of characteristic polynomials in the Dyson limit using (3.24) is highly non-trivial. Instead, we fix $t_j=t$ , $j=1,\dots, 2k$ , and give an expansion of the moments as a function of t in the large N limit.
As $N\rightarrow\infty$ , up to $O(t^2)$ ,
Note that the coefficient of $t^2$ is identically zero for even N, where as for odd N it is a polynomial in N and k. Treating the above expansions as a formal series in N and t and taking their average gives
By comparing with (3.1), the terms in the first and second parenthesis of (3.26) are the expansions of $e^{\frac{Nkt^2}{2}}$ and $\pi\rho_{sc}(t)$ up to $O(t^2)$ , respectively.
Similarly, as $N\rightarrow\infty$ , up to $O(t^4)$ ,
Taking average of the above series and factorising gives
where the first two brackets correspond to the expansion of $e^{\frac{Nkt^2}{2}}$ and $\pi\rho_{sc}(t)$ , respectively, up to $O(t^4)$ , and the last factor is sub-leading.
4. Secular coefficients
Consider a matrix M of size N. Its characteristic polynomial can be expanded as
where $\textrm{Sc}_j$ is the $j\textrm{th}$ secular coefficient of the characteristic polynomial. We have
These secular coefficients are nothing but the elementary symmetric polynomials $e_j$ defined as
for $j\leq N$ and $e_j=0$ for $j>N$ .
The correlations of secular coefficients and their connections to combinatorics have been studied previously [Reference Forrester and Gamburd21, Reference Diaconis and Gamburd17]. For example, the joint moments of secular coefficients of the unitary group are connected to the enumeration of magic squares: matrices with positive entries with prescribed row and column sum. In a similar way, the joint moments of secular coefficients of Hermitian ensembles, such as the GUE, are connected to matching polynomials of closed graphs. In this section, we compute these correlations and indicate their combinatorial properties.
Gaussian ensemble: Elementary symmetric polynomials can be expanded in terms of multivariate Hermite polynomials as
where
Equivalently, we have
with
Because of the orthogonality of the $\mathcal{H}_\mu$ ,
These expectations are nothing but the coefficients of Hermite polynomial of degree N. Thus,
which coincides with (2.20) for $p=1$ . The expectation $|N^j\mathbb{E}^{(H)}_N[\textrm{Sc}_{2j}(M)]|$ is equal to the number of 2j matchings in the complete graph [Reference Diaconis and Gamburd17, Reference Forrester and Gamburd21].
By using (4.4), the second moment of the secular coefficient can also be computed. Similar to the univariate case, multivariate Hermite polynomials $\mathscr{H}_\lambda$ corresponding to even and odd $|\lambda|$ do not mix. Hence, we obtain
and
Similarly, we write
Computing higher order correlations requires evaluating integrals involving a sequence of multivariate Hermite polynomials. Busbridge [Reference Busbridge11, Reference Busbridge12] calculated these integrals for the univariate case, but the results are still unknown for the multivariate generalisation. Instead, we take a different approach by first expressing the product $\prod_j\textrm{Sc}_j(M))^{b_j}$ in terms of the $\mathscr{H}_\mu$ and then using orthogonality for the $\mathscr{H}_\mu$ .
Proposition 4.1. Consider a partition $\lambda = (\lambda_1,\dots ,\lambda_l)$ . We have
Here $K_{\lambda\mu}$ are Kostka numbersFootnote 1 and $\chi^\mu_\nu$ is the character of the symmetric group.
Proof. For a partition $\lambda$ , denote
Elementary symmetric polynomials $e_\lambda$ can be expanded in Schur basis as follows:
where $K_{\lambda\mu}$ are the Kostka numbers [Reference Macdonald39] and $\mu$ is a partition of $|\lambda|$ . Using (2.5),
When $|\lambda|$ is odd, $\mathbb{E}^{(H)}_N[e_\lambda]=0$ due to the orthogonality of multivariate Hermite polynomials. When $|\lambda|$ is even,
It can be shown that [Reference Jonnadula, Keating and Mezzadri34]
Putting everything together completes the proof.
Laguerre ensemble: All the calculations discussed for the Gaussian ensemble can be extended to the Laguerre and the Jacobi ensembles.
The polynomials $e_r$ can be expanded as
where
By using the orthogonality of the multivariate Laguerre polynomials we arrive at
which are the absolute values of the coefficients of the Laguerre polynomial of degree N. For the characteristic polynomial, we have
The correlations of secular coefficients can be computed similar to the Gaussian case.
Proposition 4.2. Let $\lambda = (\lambda_1,\dots ,\lambda_l)$ , we have
Proof. The proof is similar to the Gaussian case. By writing
and using the orthogonality of the multivariate Laguerre polynomials along with the result [Reference Jonnadula, Keating and Mezzadri34]
proves the proposition.
Jacobi ensemble. The $e_r$ can be expanded as
where $\Psi^{(J)}_{\lambda\nu}$ is given in (2.8). The expected values of the $e_r$ are related to the coefficients of the Jacobi polynomial of degree N.
Acknowledgements
FM is grateful for support from the University Research Fellowship of the University of Bristol. JPK is pleased to acknowledge support from a Royal Society Wolfson Research Merit Award and ERC Advanced Grant 740900 (LogCorRM).
Appendix
A. Asymptotics of ratio of factorials
The asymptotics of the ratio of factorials can be computed as follows. First we look at $C_\lambda(2k)D_{e}$ with $\lambda=(2m,\dots,2m)$ . Consider
Now, one can see that
Using the duplication formula for the Gamma functions
and Stirling’s series
the asymptotic expansion for the ratio of Gamma functions can be found. Here $B_j$ is the Bernoulli polynomial of degree j. Combining all the formulae, up to first order correction,
Similarly for the case $C_\lambda(2k)D_o$ , we obtain
Let $z=m+\frac{1}{2}$ , then
and
Combining the above formulae and using (A.3) and (A.4),
Higher order corrections can also be calculated with some effort or using any commercial software like Mathematica. Writing in terms of the matrix size N, as $N\rightarrow\infty$ , we have
B. More on the second moment
Fix $\lambda=(N,N)$ . The second moment of the characteristic polynomial is given by
Let $\nu=(\nu_1,\nu_2)\subseteq \lambda$ . Since $|\nu|$ is even, either both $\nu_1$ , $\nu_2$ are even or both of them are odd. For $N=2m$ , $m\in\mathbb{N}$ ,
Therefore,
Similarly, for $N=2m+1$ , $m\in\mathbb{N}$ , we have
and
For a partition of length 2, $\nu=(\nu_1,\nu_2)$ ,
Inserting (B.3), (B.5), (B.6) in (B.1), and observing that $\nu$ runs over all partitions such that $0\leq|\nu|\leq 2N$ gives
for N even. Similarly, for N odd, one gets
We have
The asymptotics of the ratio of the factorials are already discussed in Appendix A. For the special case in (B.9),
where $B_n$ are Bernoulli numbers. The explicit asymptotic expansion is
Substituting the above asymptotic series in
and taking the average over N even and odd gives
The R.H.S. in (B.13) coincides with $\pi\rho_{sc}(t)$ up to $O(t^{10})$ .