This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Integration on complex Grassmannians, deformed monotone Hurwitz numbers, and interlacing phenomena

Xavier Coulter    Norman Do    Ellena Moskovsky
\thetitle
\theauthor

Department of Mathematics, The University of Auckland, Auckland 1142 New Zealand
School of Mathematics, Monash University, VIC 3800 Australia
School of Mathematics, Monash University, VIC 3800 Australia
Email: [email protected], [email protected], [email protected]

Abstract. We introduce a family of polynomials, which arise in three distinct ways: in the large NN expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we interpret the complex Grassmannian Gr(M,N)\mathrm{Gr}(M,N) as the space of N×NN\times N idempotent Hermitian matrices of rank MM and develop a Weingarten calculus to integrate products of matrix elements over it. In the regime of large NN and fixed ratio MN\frac{M}{N}, such integrals have expansions whose coefficients count factorisations of permutations into monotone sequences of transpositions, with each sequence weighted by a monomial in t=1NMt=1-\frac{N}{M}. This gives rise to the desired polynomials, which specialise to the monotone Hurwitz numbers when t=1t=1.

These so-called deformed monotone Hurwitz numbers satisfy a cut-and-join recursion, a one-point recursion, and the topological recursion. Furthermore, we conjecture on the basis of overwhelming empirical evidence that the deformed monotone Hurwitz numbers are real-rooted polynomials whose roots satisfy remarkable interlacing phenomena.

An outcome of our work is the viewpoint that the topological recursion can be used to “topologise” sequences of polynomials, and we claim that the resulting families of polynomials may possess interesting properties. As a further case study, we consider a weighted enumeration of dessins d’enfant and conjecture that the resulting polynomials are also real-rooted and satisfy analogous interlacing properties.

Acknowledgements. X.C. was supported by a University of Auckland Doctoral Scholarship. N.D. was supported by the Australian Research Council grant DP180103891. E.M. was supported by an Australian Government Research Training Program (RTP) Scholarship and a Monash University Postgraduate Publication Award. N.D. would like to thank Maksim Karev for planting the seed of an idea that led to this work by asking the question: “What does the topological recursion for Schröder numbers calculate?”

2020 Mathematics Subject Classification. 05A15, 05E10, 15B52, 60B20

 

 

1 Introduction

In this paper, we introduce a family of polynomials, which arise in three distinct ways: in the large NN expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. Our construction simultaneously generalises the Narayana polynomials and the monotone Hurwitz numbers, both of which have garnered considerable attention in the literature [33, 46]. We prove or conjecture that the family of polynomials we introduce satisfies a number of remarkable properties concerning their coefficients and roots, such as symmetry, unimodality, real-rootedness and interlacing.

This work is inspired by the known relations between Weingarten calculus on unitary groups, Jucys–Murphy elements in the symmetric group algebra, and monotone Hurwitz numbers [44, 33]. Our starting point is the space of N×NN\times N idempotent Hermitian matrices of rank MM, where M<NM<N. This space admits the following three descriptions, where IMI_{M} denotes the M×MM\times M identity matrix and IM,NI_{M,N} denotes the N×NN\times N matrix whose first MM diagonal entries are 1 and whose remaining entries are 0.

𝐒(M,N)\displaystyle\mathbf{S}(M,N) ={SMatN×N()S2=S,S=S and rank(S)=M}\displaystyle=\{S\in\mathrm{Mat}_{N\times N}(\mathbb{C})\mid S^{2}=S,S=S^{*}\text{ and }\mathrm{rank}(S)=M\}
={S=UUUMatM×N() and UU=IM}\displaystyle=\{S=U^{*}U\mid U\in\mathrm{Mat}_{M\times N}(\mathbb{C})\text{ and }UU^{*}=I_{M}\}
={S=UIM,NUU𝐔(N)}\displaystyle=\{S=UI_{M,N}U^{*}\mid U\in\mathbf{U}(N)\}

The unitary group 𝐔(N)\mathbf{U}(N) acts transitively on 𝐒(M,N)\mathbf{S}(M,N) by conjugation, thus endowing it with the structure of a homogeneous space. Since the stabiliser of IM,NI_{M,N} is 𝐔(M)×𝐔(NM)\mathbf{U}(M)\times\mathbf{U}(N-M), we may identify 𝐒(M,N)\mathbf{S}(M,N) with the complex Grassmannian Gr(M,N)𝐔(N)/𝐔(M)×𝐔(NM)\mathrm{Gr}(M,N)\cong\mathbf{U}(N)\,/\,\mathbf{U}(M)\times\mathbf{U}(N-M), which parametrises MM-dimensional subspaces of an NN-dimensional complex vector space.

As a compact homogeneous space, 𝐒(M,N)\mathbf{S}(M,N) inherits a normalised 𝐔(N)\mathbf{U}(N)-invariant Haar measure, which we denote succinctly by dS\mathrm{d}S. For 1i,jN1\leqslant i,j\leqslant N, define the function Sij:𝐒(M,N)S_{ij}:\mathbf{S}(M,N)\to\mathbb{C} corresponding to a matrix element. Taking our cue from the general theory of Weingarten calculus, we consider integrals of the form

𝐒(M,N)Si1j1Si2j2SikjkdS,\int_{\mathbf{S}(M,N)}S_{i_{1}j_{1}}S_{i_{2}j_{2}}\cdots S_{i_{k}j_{k}}\,\mathrm{d}S,

where 1i1,i2,,ik,j1,j2,,jkN1\leqslant i_{1},i_{2},\ldots,i_{k},j_{1},j_{2},\ldots,j_{k}\leqslant N. Our primary goal is to study such matrix integrals in the regime of large NN and fixed ratio MN\frac{M}{N}.

In recent decades, Weingarten calculus has developed into a rich theory concerned with integration on compact groups and related objects, with respect to the Haar measure [14]. Following the usual paradigm, we define a Weingarten function that takes as input a permutation σSk\sigma\in S_{k} and outputs the following elementary integral, where our notation suppresses the dependence on MM and NN.

Wg𝐒(σ)=𝐒(M,N)S1,σ(1)S2,σ(2)Sk,σ(k)dS\operatorname{Wg^{\mathbf{S}}}(\sigma)=\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}S_{2,\sigma(2)}\cdots S_{k,\sigma(k)}\,\mathrm{d}S

Modern approaches to Weingarten calculus typically rely on abstract algebraic tools such as Schur–Weyl duality [12, 15]. These are not as amenable to the current setting as the ideas rooted in the pioneering work of Weingarten [49] and revisited more recently by Collins and Matsumoto [13], which we use as inspiration to obtain the following.111This introduction includes only a cursory discussion of our main results and conjectures. The reader is encouraged to consult the main text for the relevant definitions, precise statements, and further details.

Theorem A (Weingarten calculus).
  • Convolution formula (Theorem 2.3)
    Arbitrary integrals of monomials in the matrix elements of 𝐒(M,N)\mathbf{S}(M,N) reduce to elementary integrals via the equation

    𝐒(M,N)Si1j1Si2j2SikjkdS=σSkδiσ(1),j1δiσ(2),j2δiσ(k),jkWg𝐒(σ).\int_{\mathbf{S}(M,N)}S_{i_{1}j_{1}}S_{i_{2}j_{2}}\cdots S_{i_{k}j_{k}}\,\mathrm{d}S=\sum_{\sigma\in S_{k}}\delta_{i_{\sigma(1)},j_{1}}\delta_{i_{\sigma(2)},j_{2}}\cdots\delta_{i_{\sigma(k)},j_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma).
  • Orthogonality relations (Theorem 2.4)
    For each permutation σSk\sigma\in S_{k}, the Weingarten function satisfies the relation

    Wg𝐒(σ)=1Ni=1k1Wg𝐒(σ(ik))+δσ(k),kMNWg𝐒(σ)+1Ni=1k1δσ(i),kWg𝐒([σ(ik)]).\operatorname{Wg^{\mathbf{S}}}(\sigma)=-\frac{1}{N}\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))+\delta_{\sigma(k),k}\,\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow})+\frac{1}{N}\sum_{i=1}^{k-1}\delta_{\sigma(i),k}\operatorname{Wg^{\mathbf{S}}}([\sigma\circ(i\leavevmode\nobreak\ k)]^{\downarrow}).

    Here, for any permutation ρSk\rho\in S_{k} that fixes kk, we write ρSk1\rho^{\downarrow}\in S_{k-1} to denote the permutation that agrees with ρ\rho on the set {1,2,,k1}\{1,2,\ldots,k-1\}.

The orthogonality relations allow for at least two distinct approaches to calculate values of the Weingarten function. By solving the non-degenerate linear system provided by the orthogonality relations, one can explicitly obtain values of the Weingarten function, which are rational functions of MM and NN. Alternatively, by iteratively and infinitely applying the orthogonality relations, one obtains the following large NN expansion for the Weingarten function, for fixed ratio MN\frac{M}{N}.

Theorem B (Large NN expansion, Theorem 2.12).

For a permutation σSk\sigma\in S_{k}, let wrt(σ)\vec{w}^{t}_{r}(\sigma) denote the weighted enumeration of tuples 𝛕=(τ1,τ2,,τr)\bm{\tau}=(\tau_{1},\tau_{2},\ldots,\tau_{r}) of transpositions in SkS_{k} such that

  • τ1τ2τr=σ\tau_{1}\tau_{2}\cdots\tau_{r}=\sigma;

  • the sequence 𝝉\bm{\tau} is monotone — that is, if we write τi=(aibi)\tau_{i}=(a_{i}\leavevmode\nobreak\ b_{i}) with ai<bia_{i}<b_{i}, then b1b2brb_{1}\leqslant b_{2}\leqslant\cdots\leqslant b_{r}; and

  • the weight of 𝝉\bm{\tau} is t|{b1,b2,,br}|t^{|\{b_{1},b_{2},\ldots,b_{r}\}|}.

The Weingarten function has the following large NN expansion, for fixed t=1NMt=1-\frac{N}{M}.

Wg𝐒(σ)=1(1t)kr=0wrt(σ)(1N)r\operatorname{Wg^{\mathbf{S}}}(\sigma)=\frac{1}{(1-t)^{k}}\sum_{r=0}^{\infty}\vec{w}^{t}_{r}(\sigma)\left(\frac{-1}{N}\right)^{r}

Monotone Hurwitz numbers count monotone sequences of transpositions with prescribed length and with product of a prescribed cycle type, usually with an additional transitivity assumption. They are known to arise in the Weingarten calculus for unitary groups and in the large NN expansion of the HCIZ matrix integral [33]. The theorem above motivates a “deformed” version of the monotone Hurwitz numbers, in which each sequence ((a1b1),(a2b2),,(arbr))((a_{1}\leavevmode\nobreak\ b_{1}),(a_{2}\leavevmode\nobreak\ b_{2}),\ldots,(a_{r}\leavevmode\nobreak\ b_{r})) of transpositions is weighted by the monomial t|{b1,b2,,br}|t^{|\{b_{1},b_{2},\ldots,b_{r}\}|}. The resulting polynomials in tt are referred to as deformed monotone Hurwitz numbers and denoted by Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}). Their precise definition appears in Definition 3.1 and they are the central objects introduced and studied in the present work.

The deformed monotone Hurwitz numbers obey various recursions, from which known results for the usual monotone Hurwitz numbers are recovered when t=1t=1 [32, 18, 9].

Theorem C (Recursions).
  • Cut-and-join recursion (Theorem 3.7)
    The deformed monotone Hurwitz numbers can be computed from the base case H0,1t(1)=1\vec{H}^{t}_{0,1}(1)=1 and the recursion

    μ1Hg,nt(μ1,μS)\displaystyle\mu_{1}\vec{H}^{t}_{g,n}(\mu_{1},\mu_{S}) =i=2n(μ1+μi)Hg,n1t(μ1+μi,μS{i})+(t1)(μ11)Hg,nt(μ11,μS)\displaystyle=\sum_{i=2}^{n}(\mu_{1}+\mu_{i})\,\vec{H}^{t}_{g,n-1}(\mu_{1}+\mu_{i},\mu_{S\setminus\{i\}})+(t-1)(\mu_{1}-1)\,\vec{H}^{t}_{g,n}(\mu_{1}-1,\mu_{S})
    +α+β=μ1αβ[Hg1,n+1t(α,β,μS)+g1+g2=gI1I2=SHg1,|I1|+1t(α,μI1)Hg2,|I2|+1t(β,μI2)].\displaystyle+\sum_{\alpha+\beta=\mu_{1}}\alpha\beta\Bigg{[}\vec{H}^{t}_{g-1,n+1}(\alpha,\beta,\mu_{S})+\sum_{\begin{subarray}{c}g_{1}+g_{2}=g\\ I_{1}\sqcup I_{2}=S\end{subarray}}\vec{H}^{t}_{g_{1},|I_{1}|+1}(\alpha,\mu_{I_{1}})\,\vec{H}^{t}_{g_{2},|I_{2}|+1}(\beta,\mu_{I_{2}})\Bigg{]}.
  • One-point recursion (Theorem 3.12)
    The one-point deformed monotone Hurwitz numbers — in other words, those with n=1n=1 — satisfy

    d2Hg,1t(d)=(d1)(2d3)(t+1)Hg,1t(d1)(d2)(d3)(t1)2Hg,1t(d2)+d2(d1)2Hg1,1t(d).d^{2}\,\vec{H}^{t}_{g,1}(d)=(d-1)(2d-3)(t+1)\,\vec{H}^{t}_{g,1}(d-1)-(d-2)(d-3)(t-1)^{2}\,\vec{H}^{t}_{g,1}(d-2)+d^{2}(d-1)^{2}\,\vec{H}^{t}_{g-1,1}(d).
  • Topological recursion (Theorem 4.1)
    The deformed monotone Hurwitz numbers are governed by the topological recursion on the genus zero spectral curve xy2+(t1)xyy+1=0xy^{2}+(t-1)xy-y+1=0.

These recursions are all effective and can be used to produce explicit data, some of which is contained in Appendix A. At the level of coefficients, each deformed monotone Hurwitz number is symmetric (the sequence of coefficients is palindromic) and unimodal (the sequence of coefficients increases to a point and then decreases). We prove this in Proposition 3.9 using the cut-and-join recursion and note that these properties are not immediate from the combinatorial deformation of the deformed monotone Hurwitz numbers.

At the level of roots, it appears that the deformed monotone Hurwitz numbers are real-rooted and that they exhibit interlacing phenomena. Two real-rooted polynomials are said to interlace if their degrees differ by one and their roots weakly alternate on the real number line. We have gathered overwhelming numerical evidence to support the following conjectures.

Conjecture D (Roots).
  • Real-rootedness (Conjecture 3.13)
    The deformed monotone Hurwitz number Hg,nt(μ1,μ2,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}) is a real-rooted polynomial in tt.

  • Interlacing (Conjecture 3.14)
    The polynomial Hg,nt(μ1,μ2,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}) interlaces each of the nn polynomials

    Hg,nt(μ1+1,μ2,,μn),Hg,nt(μ1,μ2+1,,μn),,Hg,nt(μ1,μ2,,μn+1).\vec{H}^{t}_{g,n}(\mu_{1}+1,\mu_{2},\ldots,\mu_{n}),\quad\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2}+1,\ldots,\mu_{n}),\quad\ldots,\quad\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}+1).

In the case (g,n)=(0,1)(g,n)=(0,1), the deformed monotone Hurwitz numbers recover the sequence of Narayana polynomials via the equation

(μ+1)H0,1t(μ+1)=Narμ(t):=i=1μ1μ(μi)(μi1)ti.(\mu+1)\,\vec{H}^{t}_{0,1}(\mu+1)=\mathrm{Nar}_{\mu}(t):=\sum_{i=1}^{\mu}\frac{1}{\mu}\binom{\mu}{i}\binom{\mu}{i-1}\,t^{i}. (1)

Thus, we consider the deformed monotone Hurwitz numbers to be a “topological generalisation” of the Narayana polynomials. We propose the topological recursion as a mechanism to “topologise” sequences of polynomials more generally. In particular, we claim that doing so can preserve interesting behaviour in the polynomials, such as symmetry, unimodality, real-rootedness, and interlacing properties. This is not only the case for the deformed monotone Hurwitz numbers, but we also observe these phenomena in the weighted enumeration of dessins d’enfant — in other words, bicoloured maps — in which each black vertex in a dessin d’enfant is assigned a multiplicative weight tt.

Our results concerning integration on complex Grassmannians and deformed monotone Hurwitz numbers suggest various avenues for further research. It would be natural to consider integration on real Grassmannians Gr(M,N)\mathrm{Gr}(M,N), also in the regime of large NN with fixed ratio MN\frac{M}{N}, and the first two authors are currently pursuing this line of investigation. Matsumoto considered Weingarten calculus on compact symmetric spaces [39] and the particular case of the symmetric space AIII bears a strong resemblance to the present work. It would be interesting to further develop the parallels between these two settings. The real-rootedness and interlacing conjectures for deformed monotone Hurwitz numbers (Conjectures 3.13 and 3.14) and the weighted dessin d’enfant enumeration (Conjecture 4.11) not only require proof, but also invite a deeper exploration of how common these phenomena might be.

The structure of the paper is as follows.

  • In Section 2, we develop the Weingarten calculus for integration over 𝐒(M,N)\mathbf{S}(M,N). This includes a convolution formula (Theorem 2.3) and orthogonality relations (Theorem 2.4). We use the latter to express the Weingarten function of a permutation as a weighted enumeration of monotone sequences of transpositions (Theorem 2.12). As a consequence, the Weingarten function can be written succinctly in terms of Jucys–Murphy elements in the symmetric group algebra (Proposition 2.14).

  • In Section 3, we define the notion of deformed monotone Hurwitz numbers, which are polynomials in the deformation parameter tt, motivated by the results of the previous section. We prove “deformed” analogues of existing results concerning the usual monotone Hurwitz numbers, such as a character formula (Proposition 3.3), a cut-and-join recursion (Theorem 3.7), and a one-point recursion (Theorem 3.12). It follows from the cut-and-join recursion that the coefficients of deformed monotone Hurwitz numbers are symmetric and unimodal (Proposition 3.9). On the basis of extensive numerical evidence, we conjecture that these polynomials are real-rooted (Conjecture 3.13) and that their roots satisfy remarkable interlacing phenomena (Conjecture 3.14).

  • In Section 4, we briefly introduce the topological recursion of Chekhov, Eynard and Orantin [11, 25] and then use a powerful result of Bychkov, Dunin-Barkowski, Kazarian and Shadrin [8] to prove that topological recursion on the spectral curve xy2+(t1)xyy+1=0xy^{2}+(t-1)xy-y+1=0 governs the deformed monotone Hurwitz numbers (Theorem 4.1). We propose the topological recursion as a mechanism to produce topological generalisations of sequences of polynomials with interesting properties. As a case study, we consider the weighted enumeration of dessins d’enfant — in other words, bicoloured maps — in which each black vertex receives a multiplicative weight tt. This produces a family of polynomials that also satisfies a cut-and-join recursion (Proposition 4.8) and the topological recursion (Theorem 4.10). In analogy with the case of deformed monotone Hurwitz numbers studied in the previous section, we conjecture that these polynomials exhibit real-rootedness and interlacing phenomena (Conjecture 4.11).

2 Weingarten calculus

2.1 Convolution formula and orthogonality relations

As mentioned in the introduction, the present work is concerned with integration on the complex Grasmannian Gr(M,N)\mathrm{Gr}(M,N) for M<NM<N. We interpret this Grassmannian as the space of N×NN\times N idempotent Hermitian matrices of rank MM, which admits three equivalent descriptions as per the following definition.

Definition 2.1.

Let IMI_{M} denote the M×MM\times M identity matrix and IM,NI_{M,N} denote the N×NN\times N matrix whose first MM diagonal entries are 1 and whose remaining entries are 0. For M<NM<N, define the space

𝐒(M,N)\displaystyle\mathbf{S}(M,N) ={SMatN×N()S2=S,S=S and rank(S)=M}\displaystyle=\{S\in\mathrm{Mat}_{N\times N}(\mathbb{C})\mid S^{2}=S,S=S^{*}\text{ and }\mathrm{rank}(S)=M\}
={S=UUUMatM×N() and UU=IM}\displaystyle=\{S=U^{*}U\mid U\in\mathrm{Mat}_{M\times N}(\mathbb{C})\text{ and }UU^{*}=I_{M}\}
={S=UIM,NUU𝐔(N)}.\displaystyle=\{S=UI_{M,N}U^{*}\mid U\in\mathbf{U}(N)\}.

The unitary group 𝐔(N)\mathbf{U}(N) acts transitively on 𝐒(M,N)\mathbf{S}(M,N) by conjugation, thus endowing it with the structure of a compact homogeneous space. Thus, the Haar measure on 𝐔(N)\mathbf{U}(N) induces a 𝐔(N)\mathbf{U}(N)-invariant normalised Haar measure on 𝐒(M,N)\mathbf{S}(M,N), which we denote succinctly by dS\mathrm{d}S. (See [16] for an introduction to Haar measures.) The fact that the stabiliser of IM,N𝐒(M,N)I_{M,N}\in\mathbf{S}(M,N) is 𝐔(M)×𝐔(NM)\mathbf{U}(M)\times\mathbf{U}(N-M) allows us to identify 𝐒(M,N)\mathbf{S}(M,N) with the complex Grassmannian Gr(M,N)𝐔(N)/𝐔(M)×𝐔(NM)\mathrm{Gr}(M,N)\cong\mathbf{U}(N)\,/\,\mathbf{U}(M)\times\mathbf{U}(N-M).

For 1i,jN1\leqslant i,j\leqslant N, define the function Sij:𝐒(M,N)S_{ij}:\mathbf{S}(M,N)\to\mathbb{C} corresponding to the (i,j)(i,j) matrix element. Our primary goal is to calculate integrals of the form

𝐒(M,N)Si1j1Si2j2SikjkdS,\int_{\mathbf{S}(M,N)}S_{i_{1}j_{1}}S_{i_{2}j_{2}}\cdots S_{i_{k}j_{k}}\,\mathrm{d}S,

where 1i1,i2,,ik,j1,j2,,jkN1\leqslant i_{1},i_{2},\ldots,i_{k},j_{1},j_{2},\ldots,j_{k}\leqslant N. We impose the technical assumption that kNk\leqslant N for future convenience. However, this assumption has little bearing on our work, since we will study these matrix integrals in the regime of large NN and fixed ratio MN\frac{M}{N}. The following elementary integrals will be of particular importance.

Definition 2.2 (Weingarten function).

For each permutation σSk\sigma\in S_{k}, define the integral

Wg𝐒(σ)=𝐒(M,N)S1,σ(1)S2,σ(2)Sk,σ(k)dS.\operatorname{Wg^{\mathbf{S}}}(\sigma)=\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}S_{2,\sigma(2)}\cdots S_{k,\sigma(k)}\,\mathrm{d}S.

We refer to the function Wg𝐒:S0S1S2\operatorname{Wg^{\mathbf{S}}}:S_{0}\sqcup S_{1}\sqcup S_{2}\sqcup\cdots\to\mathbb{C} as the Weingarten function for 𝐒(M,N)\mathbf{S}(M,N). Here, we include the symmetric group S0S_{0}, whose unique element is denoted ()(\,) and represents the empty permutation. In the notation for the Weingarten function, we suppress the dependence on MM and NN to avoid clutter.

The setup described above sits firmly in the realm of Weingarten calculus, which is broadly concerned with the calculation of integrals on compact groups and related objects with respect to the Haar measure [14]. Modern accounts of Weingarten calculus often rely on elegant algebraic approaches via Schur–Weyl duality [12, 15]. A direct use of such an argument is not immediately available for the case of integration over 𝐒(M,N)\mathbf{S}(M,N). We instead follow the approach via orthogonality relations utilised by Collins and Matsumoto [13], which is in turn inspired by the ideas contained in the seminal paper of Weingarten [49].

In the remainder of this section, we develop the Weingarten calculus for integration on 𝐒(M,N)\mathbf{S}(M,N) in three parts. First, we prove a convolution formula that reduces general integrals of monomials in the matrix elements to the elementary ones defined in Definition 2.2. Second, we prove so-called orthogonality relations that completely determine all values of the Weingarten function. Third, we solve the linear system provided by these orthogonality relations, which connects naturally to the representation theory of the symmetric groups, particularly to the Jucys–Murphy elements in the symmetric group algebra.

Theorem 2.3 (Convolution formula).

Arbitrary integrals of monomials in the matrix elements of 𝐒(M,N)\mathbf{S}(M,N) reduce to elementary integrals via the equation

𝐒(M,N)Si1j1Si2j2SikjkdS=σSkδiσ(1),j1δiσ(2),j2δiσ(k),jkWg𝐒(σ).\int_{\mathbf{S}(M,N)}S_{i_{1}j_{1}}S_{i_{2}j_{2}}\cdots S_{i_{k}j_{k}}\,\mathrm{d}S=\sum_{\sigma\in S_{k}}\delta_{i_{\sigma(1)},j_{1}}\delta_{i_{\sigma(2)},j_{2}}\cdots\delta_{i_{\sigma(k)},j_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma).
Proof.

Write S𝐒(M,N)S\in\mathbf{S}(M,N) in the form S=UIM,NUS=UI_{M,N}U^{*} for U𝐔(N)U\in\mathbf{U}(N). Then the two sides of the desired equation can be equivalently expressed as integrals over 𝐔(N)\mathbf{U}(N).

LHS =m1,,mk=1N(i=1k[IM,N]mimi)𝐔(N)Ui1m1UikmkUm1j1UmkjkdU\displaystyle=\sum_{m_{1},\ldots,m_{k}=1}^{N}\bigg{(}\prod_{i=1}^{k}\left[I_{M,N}\right]_{m_{i}m_{i}}\bigg{)}\int_{\mathbf{U}(N)}U_{i_{1}m_{1}}\cdots U_{i_{k}m_{k}}U_{m_{1}j_{1}}^{*}\cdots U_{m_{k}j_{k}}^{*}\,\mathrm{d}U
RHS =σSk(a=1kδiσ(a),ja)m1,,mk=1N(i=1k[IM,N]mimi)𝐔(N)U1m1UkmkUm1,σ(1)Umk,σ(k)dU\displaystyle=\sum_{\sigma\in S_{k}}\bigg{(}\prod_{a=1}^{k}\delta_{i_{\sigma(a)},j_{a}}\bigg{)}\sum_{m_{1},\ldots,m_{k}=1}^{N}\bigg{(}\prod_{i=1}^{k}\left[I_{M,N}\right]_{m_{i}m_{i}}\bigg{)}\int_{\mathbf{U}(N)}U_{1m_{1}}\cdots U_{km_{k}}U_{m_{1},\sigma(1)}^{*}\cdots U_{m_{k},\sigma(k)}^{*}\,\mathrm{d}U

Thus, the result would follow from the equation

𝐔(N)Ui1m1UikmkUm1j1UmkjkdU=σSkδiσ(1),j1δiσ(k),jk𝐔(N)U1m1UkmkUm1,σ(1)Umk,σ(k)dU.\int_{\mathbf{U}(N)}U_{i_{1}m_{1}}\cdots U_{i_{k}m_{k}}U_{m_{1}j_{1}}^{*}\cdots U_{m_{k}j_{k}}^{*}\,\mathrm{d}U\\ =\sum_{\sigma\in S_{k}}\delta_{i_{\sigma(1)},j_{1}}\cdots\delta_{i_{\sigma(k)},j_{k}}\int_{\mathbf{U}(N)}U_{1m_{1}}\cdots U_{km_{k}}U_{m_{1},\sigma(1)}^{*}\cdots U_{m_{k},\sigma(k)}^{*}\,\mathrm{d}U.

However, this is a direct consequence of applying the convolution formula for 𝐔(N)\mathbf{U}(N) [15, Corollary 2.4] to both sides. ∎

The following orthogonality relations for Wg𝐒\operatorname{Wg^{\mathbf{S}}} are inspired by the orthogonality relations obtained by Collins and Matsumoto in other settings for Weingarten calculus [13]. The proof crucially relies on the convolution formula of Theorem 2.3. For future reference, observe that we use the notational convention of composing permutations from right to left.

Theorem 2.4 (Orthogonality relations).

For each permutation σSk\sigma\in S_{k}, the Weingarten function satisfies the relation

Wg𝐒(σ)=1Ni=1k1Wg𝐒(σ(ik))+δσ(k),kMNWg𝐒(σ)+1Ni=1k1δσ(i),kWg𝐒([σ(ik)]).\operatorname{Wg^{\mathbf{S}}}(\sigma)=-\frac{1}{N}\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))+\delta_{\sigma(k),k}\,\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow})+\frac{1}{N}\sum_{i=1}^{k-1}\delta_{\sigma(i),k}\operatorname{Wg^{\mathbf{S}}}([\sigma\circ(i\leavevmode\nobreak\ k)]^{\downarrow}).

Here, for any permutation ρSk\rho\in S_{k} that fixes kk, we write ρSk1\rho^{\downarrow}\in S_{k-1} to denote the permutation that agrees with ρ\rho on the set {1,2,,k1}\{1,2,\ldots,k-1\}.

Proof.

Let σSk\sigma\in S_{k} and consider the cases σ(k)=k\sigma(k)=k and σ(k)k\sigma(k)\neq k separately.

Case 1. Suppose σ(k)=k\sigma(k)=k.
Consider the integral

i=1N𝐒(M,N)S1,σ(1)S2,σ(2)Sk1,σ(k1)Si,idS.\sum_{i=1}^{N}\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}S_{2,\sigma(2)}\cdots S_{k-1,\sigma(k-1)}S_{i,i}\,\mathrm{d}S. (\ast)

On the one hand, we can use i=1NSii=Tr(S)=Tr(UIM,NU)=Tr(IM,N)=M\sum_{i=1}^{N}S_{ii}=\mathrm{Tr}(S)=\mathrm{Tr}(UI_{M,N}U^{*})=\mathrm{Tr}(I_{M,N})=M and the definition of Wg𝐒\operatorname{Wg^{\mathbf{S}}} to express the integral as MWg𝐒(σ)M\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow}). On the other hand, we can apply the convolution formula directly to each summand. For the iith summand, where 1i<k1\leqslant i<k, the convolution formula yields

𝐒(M,N)S1,σ(1)Si,σ(i)Sk1,σ(k1)Si,idS=Wg𝐒(σ)+Wg𝐒(σ(ik)).\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}\cdots S_{i,\sigma(i)}\cdots S_{k-1,\sigma(k-1)}S_{i,i}\,\mathrm{d}S=\operatorname{Wg^{\mathbf{S}}}(\sigma)+\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k)).

For the iith summand, where kiNk\leqslant i\leqslant N, the convolution formula yields

𝐒(M,N)S1,σ(1)S2,σ(2)Sk1,σ(k1)Si,idS=Wg𝐒(σ).\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}S_{2,\sigma(2)}\cdots S_{k-1,\sigma(k-1)}S_{i,i}\,\mathrm{d}S=\operatorname{Wg^{\mathbf{S}}}(\sigma).

Adding these contributions over i=1,2,,Ni=1,2,\ldots,N and equating with the expression we previously obtained for the integral (\ast) leads to

MWg𝐒(σ)\displaystyle M\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow}) =NWg𝐒(σ)+i=1k1Wg𝐒(σ(ik))\displaystyle=N\operatorname{Wg^{\mathbf{S}}}(\sigma)+\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))
Wg𝐒(σ)\displaystyle\Rightarrow\qquad\operatorname{Wg^{\mathbf{S}}}(\sigma) =1Ni=1k1Wg𝐒(σ(ik))+MNWg𝐒(σ).\displaystyle=-\frac{1}{N}\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow}). (2)

Case 2. Suppose σ(k)k\sigma(k)\neq k.
Let j=σ1(k)j=\sigma^{-1}(k) and consider the integral

i=1N𝐒(M,N)(S1,σ(1)Sj1,σ(j1))Sj,i(Sj+1,σ(j+1)Sk1,σ(k1))Si,σ(k)dS.\sum_{i=1}^{N}\int_{\mathbf{S}(M,N)}\left(S_{1,\sigma(1)}\cdots S_{j-1,\sigma(j-1)}\right)S_{j,i}\left(S_{j+1,\sigma(j+1)}\cdots S_{k-1,\sigma(k-1)}\right)S_{i,\sigma(k)}\,\mathrm{d}S. (\ast\ast)

On the one hand, we have S2=SS^{2}=S for all S𝐒(M,N)S\in\mathbf{S}(M,N), so it follows that i=1NSj,iSi,σ(k)=Sj,σ(k)\sum_{i=1}^{N}S_{j,i}S_{i,\sigma(k)}=S_{j,\sigma(k)}. Combining this observation with the convolution formula allows us to express the integral as

𝐒(M,N)S1,σ(1)Sj1,σ(j1)Sj,σ(k)Sj+1,σ(j+1)Sk1,σ(k1)dS=Wg𝐒([σ(jk)]).\int_{\mathbf{S}(M,N)}S_{1,\sigma(1)}\cdots S_{j-1,\sigma(j-1)}S_{j,\sigma(k)}S_{j+1,\sigma(j+1)}\cdots S_{k-1,\sigma(k-1)}\,\mathrm{d}S=\operatorname{Wg^{\mathbf{S}}}(\left[\sigma\circ(j\leavevmode\nobreak\ k)\right]^{\downarrow}).

On the other hand, we can apply the convolution formula directly to each summand, resulting in a calculation analogous to that of Case 1. For the iith summand, where 1i<k1\leqslant i<k, the convolution formula yields

𝐒(M,N)(S1,σ(1)Sj1,σ(j1))Sj,i(Sj+1,σ(j+1)Sk1,σ(k1))Si,σ(k)dS=Wg𝐒(σ)+Wg𝐒(σ(ik)).\int_{\mathbf{S}(M,N)}\left(S_{1,\sigma(1)}\cdots S_{j-1,\sigma(j-1)}\right)S_{j,i}\left(S_{j+1,\sigma(j+1)}\cdots S_{k-1,\sigma(k-1)}\right)S_{i,\sigma(k)}\,\mathrm{d}S=\operatorname{Wg^{\mathbf{S}}}(\sigma)+\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k)).

For the iith summand, where kiNk\leqslant i\leqslant N, the convolution formula yields

𝐒(M,N)(S1,σ(1)Sj1,σ(j1))Sj,i(Sj+1,σ(j+1)Sk1,σ(k1))Si,σ(k)dS=Wg𝐒(σ).\int_{\mathbf{S}(M,N)}\left(S_{1,\sigma(1)}\cdots S_{j-1,\sigma(j-1)}\right)S_{j,i}\left(S_{j+1,\sigma(j+1)}\cdots S_{k-1,\sigma(k-1)}\right)S_{i,\sigma(k)}\,\mathrm{d}S=\operatorname{Wg^{\mathbf{S}}}(\sigma).

Adding these contributions over i=1,2,,Ni=1,2,\ldots,N and equating with the expression we previously obtained for the integral (\ast\ast) leads to

Wg𝐒([σ(jk)])\displaystyle\operatorname{Wg^{\mathbf{S}}}(\left[\sigma\circ(j\leavevmode\nobreak\ k)\right]^{\downarrow}) =NWg𝐒(σ)+i=1k1Wg𝐒(σ(ik))\displaystyle=N\operatorname{Wg^{\mathbf{S}}}(\sigma)+\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))
Wg𝐒(σ)\displaystyle\Rightarrow\qquad\operatorname{Wg^{\mathbf{S}}}(\sigma) =1Ni=1k1Wg𝐒(σ(ik))+1NWg𝐒([σ(jk)]).\displaystyle=-\frac{1}{N}\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}(\sigma\circ(i\leavevmode\nobreak\ k))+\frac{1}{N}\operatorname{Wg^{\mathbf{S}}}(\left[\sigma\circ(j\leavevmode\nobreak\ k)\right]^{\downarrow}). (3)

Finally, the desired result is obtained by writing the two expressions for Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) obtained in Sections 2.1 and 2.1 from the two separate cases in one formula, making use of the Kronecker delta notation. ∎

The orthogonality relations provide a non-degenerate linear system of equations that uniquely determines the Weingarten function. The example below shows that values of the Weingarten function can be computed explicitly and are rational functions of MM and NN.

Example 2.5.

By the orthogonality relations of Theorem 2.4 and the conjugacy invariance of Wg𝐒\operatorname{Wg^{\mathbf{S}}}, we obtain the following equations.

Wg𝐒((1)(2)(3))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1)(2)(3)) =1N[Wg𝐒((1 3)(2))+Wg𝐒((2 3)(1))]+MNWg𝐒((1)(2))\displaystyle=-\frac{1}{N}\left[\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 3)(2))+\operatorname{Wg^{\mathbf{S}}}((2\leavevmode\nobreak\ 3)(1))\right]+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}((1)(2))
=2NWg𝐒((1 2)(3))+MNWg𝐒((1)(2))\displaystyle=-\frac{2}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2)(3))+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}((1)(2))
Wg𝐒((1 2)(3))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2)(3)) =1N[Wg𝐒((1 3 2))+Wg𝐒((1 2 3)]+MNWg𝐒((1 2))\displaystyle=-\frac{1}{N}\left[\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 3\leavevmode\nobreak\ 2))+\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2\leavevmode\nobreak\ 3)\right]+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))
=2NWg𝐒((1 2 3))+MNWg𝐒((1 2))\displaystyle=-\frac{2}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2\leavevmode\nobreak\ 3))+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))
Wg𝐒((1 2 3))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2\leavevmode\nobreak\ 3)) =1N[Wg𝐒((2 3)(1))+Wg𝐒((1 2)(3)]+1NWg𝐒((1 2))\displaystyle=-\frac{1}{N}\left[\operatorname{Wg^{\mathbf{S}}}((2\leavevmode\nobreak\ 3)(1))+\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2)(3)\right]+\frac{1}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))
=2NWg𝐒((1 2)(3))+1NWg𝐒((1 2))\displaystyle=-\frac{2}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2)(3))+\frac{1}{N}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))

Using the values Wg𝐒((1)(2))=M(MN1)N(N21)\operatorname{Wg^{\mathbf{S}}}((1)(2))=\frac{M(MN-1)}{N(N^{2}-1)} and Wg𝐒((12))=M(MN)N(N21)\operatorname{Wg^{\mathbf{S}}}((12))=\frac{-M(M-N)}{N(N^{2}-1)}, one can solve this linear system of equations to obtain the following unique solution.

Wg𝐒((1)(2)(3))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1)(2)(3)) =2(MN2)N(N24)Wg𝐒((1 2))+MNWg𝐒((1)(2))=M(M2N22M23MN+4)N(N21)(N24)\displaystyle=\frac{-2(MN-2)}{N(N^{2}-4)}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))+\frac{M}{N}\operatorname{Wg^{\mathbf{S}}}((1)(2))=\frac{M(M^{2}N^{2}-2M^{2}-3MN+4)}{N(N^{2}-1)(N^{2}-4)}
Wg𝐒((1 2)(3))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2)(3)) =MN2N24Wg𝐒((1 2))=M(MN)(MN2)N(N21)(N24)\displaystyle=\frac{MN-2}{N^{2}-4}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))=\frac{-M(M-N)(MN-2)}{N(N^{2}-1)(N^{2}-4)}
Wg𝐒((1 2 3)))\displaystyle\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2\leavevmode\nobreak\ 3))) =N2MN24Wg𝐒((1 2))=M(MN)(2MN)N(N21)(N24)\displaystyle=\frac{N-2M}{N^{2}-4}\operatorname{Wg^{\mathbf{S}}}((1\leavevmode\nobreak\ 2))=\frac{M(M-N)(2M-N)}{N(N^{2}-1)(N^{2}-4)}

In this way, one can begin with the base case Wg𝐒(())=1\operatorname{Wg^{\mathbf{S}}}((\,))=1 and inductively obtain Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) for σSk\sigma\in S_{k} in terms of Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma^{\prime}) for σSk1\sigma^{\prime}\in S_{k-1}. Further values can be found in Appendix A.

2.2 Large NN expansion

A priori, computing the values of the Weingarten function Wg𝐒\operatorname{Wg^{\mathbf{S}}} via the integral definition is far from straightforward. However, as evidenced by the calculations of Example 2.5, the orthogonality relations of Theorem 2.4 uniquely determine the Weingarten function and imply that its values are rational functions of MM and NN. We will shortly see that their structure also leads directly to a large NN expansion for Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma), with coefficients that enumerate factorisations of σ\sigma into transpositions that satisfy a certain monotonicity condition. This combinatorial structure can be understood in terms of paths in the Weingarten graph, which encode the result of recursively applying the orthogonality relations ad infinitum. The notion of a Weingarten graph was originally introduced by Collins and Matsumoto [13]. In the setting of integration over unitary groups, the Weingarten graph 𝒢𝐔\mathcal{G}^{\mathbf{U}} has two types of edges, which reflects the fact that the orthogonality relations in that case express the Weingarten function of a permutation in terms of two types of terms. In the setting of integration over 𝐒(M,N)\mathbf{S}(M,N), we have three terms appearing on the right side of the orthogonality relations, motivating the following definition.

Definition 2.6.

Define the Weingarten graph 𝒢𝐒\mathcal{G}^{\mathbf{S}} to be the infinite directed graph with vertex set S=i=0SiS=\bigsqcup_{i=0}^{\infty}S_{i} and edge set E=EAEBECE=E_{A}\sqcup E_{B}\sqcup E_{C}, where:

  • the set EAE_{A} comprises the “type AA” edges, which are of the form

    σ{\sigma}σ(ik){{\sigma\circ(i\leavevmode\nobreak\ k)}}

    for σSk\sigma\in S_{k} and 1i<k1\leqslant i<k;

  • the set EBE_{B} comprises the “type BB” edges, which are of the form

    σ{\sigma}σ{\sigma^{\downarrow}}

    for σSk\sigma\in S_{k} with σ(k)=k\sigma(k)=k; and

  • the set ECE_{C} comprises the “type CC” edges, which are of the form

    σ{\sigma}[σ(ik)]{{[\sigma\circ(i\leavevmode\nobreak\ k)]^{\downarrow}}}

    for σSk\sigma\in S_{k} such that σ(i)=k\sigma(i)=k for some 1i<k1\leqslant i<k.

(13)(2)(13)(2)(1)(2)(3)(1)(2)(3)(23)(1)(23)(1)(123)(123)(12)(3)(12)(3)(132)(132)(1)(2)(1)(2)(12)(12)(1)(1)()(\,)
Figure 1: The part of the Weingarten graph 𝒢𝐒\mathcal{G}^{\mathbf{S}} induced by vertices belonging to S0S1S2S3S_{0}\sqcup S_{1}\sqcup S_{2}\sqcup S_{3}.
Remark 2.7.

The Weingarten graph 𝒢𝐔\mathcal{G}^{\mathbf{U}} in the setting of integration over 𝐔(N)\mathbf{U}(N) appears in [13] and is the subgraph of 𝒢𝐒\mathcal{G}^{\mathbf{S}} obtained by removing all type CC edges.

Repeated application of the orthogonality relations leads to paths in the Weingarten graph 𝒢𝐒\mathcal{G}^{\mathbf{S}}. In this way, one is motivated to enumerate paths in the Weingarten graph in which edges of types AA, BB, CC receive multiplicative weights 1N-\frac{1}{N}, MN\frac{M}{N}, 1N\frac{1}{N}, respectively.

Definition 2.8.

A path in 𝒢𝐒\mathcal{G}^{\mathbf{S}} is a sequence of permutations

𝝆=(ρ0,ρ1,ρ2,,ρ)S+1,\bm{\rho}=(\rho_{0},\rho_{1},\rho_{2},\ldots,\rho_{\ell})\in S^{\ell+1},

where (ρi1,ρi)(\rho_{i-1},\rho_{i}) is a directed edge of 𝒢𝐒\mathcal{G}^{\mathbf{S}} for each i=1,2,,i=1,2,\ldots,\ell. We call the integer =(𝝆)\ell=\ell(\bm{\rho}) the length of the path and denote by 𝒫(σ,σ)\mathcal{P}(\sigma,\sigma^{\prime}) the set of all paths from σ\sigma to σ\sigma^{\prime}. Define the weight w(𝝆)w(\bm{\rho}) of a path 𝝆\bm{\rho} by

(1N)A(𝝆)(MN)B(𝝆)(1N)C(𝝆),\left(-\frac{1}{N}\right)^{\ell_{A}(\bm{\rho})}\left(\frac{M}{N}\right)^{\ell_{B}(\bm{\rho})}\left(\frac{1}{N}\right)^{\ell_{C}(\bm{\rho})},

where K(𝝆)\ell_{K}(\bm{\rho}) denotes the number of edges of type K{A,B,C}K\in\{A,B,C\} on the path 𝝆\bm{\rho}.

By construction, the Weingarten graph is a combinatorial encoding of the orthogonality relations and their repeated application. Starting with σSk\sigma\in S_{k}, iterating the orthogonality relations \ell times produces the formula

Wg𝐒(σ)=𝝆𝒫(σ,())(𝝆)w(𝝆)+σS1SkWg𝐒(σ)𝝆𝒫(σ,σ)(𝝆)=w(𝝆).\operatorname{Wg^{\mathbf{S}}}(\sigma)=\sum_{\begin{subarray}{c}\bm{\rho}\in\mathcal{P}(\sigma,(\,))\\ \ell(\bm{\rho})\leqslant\ell\end{subarray}}w(\bm{\rho})+\sum_{\sigma^{\prime}\in S_{1}\sqcup\cdots\sqcup S_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma^{\prime})\sum_{\begin{subarray}{c}\bm{\rho}\in\mathcal{P}(\sigma,\sigma^{\prime})\\ \ell(\bm{\rho})=\ell\end{subarray}}w(\bm{\rho}).

By sending the number of iterations \ell to infinity, one obtains the following large NN expansion of the Weingarten function.

Proposition 2.9.

For any permutation σ\sigma, we have the large NN expansion

Wg𝐒(σ)=𝝆𝒫(σ,())w(𝝆)=𝝆𝒫(σ,())(1N)A(𝝆)(MN)B(𝝆)(1N)C(𝝆).\operatorname{Wg^{\mathbf{S}}}(\sigma)=\sum_{\bm{\rho}\in\mathcal{P}(\sigma,(\,))}w(\bm{\rho})=\sum_{\bm{\rho}\in\mathcal{P}(\sigma,(\,))}\bigg{(}-\frac{1}{N}\bigg{)}^{\ell_{A}(\bm{\rho})}\bigg{(}\frac{M}{N}\bigg{)}^{\ell_{B}(\bm{\rho})}\bigg{(}\frac{1}{N}\bigg{)}^{\ell_{C}(\bm{\rho})}.

At this point, let us consider the Weingarten function in the regime of large NN with fixed ratio q=MNq=\frac{M}{N}.222One could of course consider other regimes, such as fixed MM, although this line of investigation did not appear to be as fruitful. For 𝝆𝒫(σ,())\bm{\rho}\in\mathcal{P}(\sigma,(\,)) and σSk\sigma\in S_{k}, we have B(𝝆)+C(𝝆)=k\ell_{B}(\bm{\rho})+\ell_{C}(\bm{\rho})=k, which leads to

Wg𝐒(σ)=qkr=0(1N)r𝝆𝒫(σ,())A(𝝆)+C(𝝆)=r(1q)C(𝝆).\operatorname{Wg^{\mathbf{S}}}(\sigma)=q^{k}\sum_{r=0}^{\infty}\left(-\frac{1}{N}\right)^{r}\sum_{\begin{subarray}{c}\bm{\rho}\in\mathcal{P}(\sigma,(\,))\\ \ell_{A}(\bm{\rho})+\ell_{C}(\bm{\rho})=r\end{subarray}}\left(-\frac{1}{q}\right)^{\ell_{C}(\bm{\rho})}.

To develop a clearer combinatorial description of the coefficients appearing in the expansion above, we consider the correspondence between paths in the Weingarten graph and monotone factorisations. This connection already appears in the Weingarten calculus for unitary groups [13].

Definition 2.10.

A monotone factorisation of σSk\sigma\in S_{k} is a sequence 𝝉=(τ1,τ2,,τr)\bm{\tau}=(\tau_{1},\tau_{2},\ldots,\tau_{r}) of transpositions in SkS_{k} such that

  • τ1τ2τr=σ\tau_{1}\tau_{2}\cdots\tau_{r}=\sigma; and

  • if we write τi=(aibi)\tau_{i}=(a_{i}\leavevmode\nobreak\ b_{i}) with ai<bia_{i}<b_{i}, then b1b2brb_{1}\leqslant b_{2}\leqslant\cdots\leqslant b_{r}.

Moreover, we call a monotone factorisation transitive if τ1,τ2,,τr\tau_{1},\tau_{2},\ldots,\tau_{r} generate a transitive subgroup of SkS_{k}. Denote the set of monotone factorisations of σ\sigma by (σ)\mathcal{M}(\sigma) and the length of 𝝉\bm{\tau} by r(𝝉)r(\bm{\tau}). We refer to the number of distinct elements of the multiset {b1,b2,,br}\{b_{1},b_{2},\ldots,b_{r}\} as the hive number of 𝝉\bm{\tau} and denote this quantity by b(𝝉)b(\bm{\tau}).

Given a path in the Weingarten graph 𝒢𝐒\mathcal{G}^{\mathbf{S}} from σ\sigma to ()(\,), one can record the sequence of transpositions arising from the type AA edges and the type CC edges. The composition of these transpositions in reverse order recovers the permutation σ\sigma. Thus, a path 𝝆𝒫(σ,())\bm{\rho}\in\mathcal{P}(\sigma,(\,)) gives rise to a monotone factorisation 𝝉(σ)\bm{\tau}\in\mathcal{M}(\sigma) satisfying A(𝝆)+C(𝝆)=r(𝝉)\ell_{A}(\bm{\rho})+\ell_{C}(\bm{\rho})=r(\bm{\tau}). Represent this construction via the map

:𝒫(σ,())(σ).\mathcal{F}:\mathcal{P}(\sigma,(\,))\to\mathcal{M}(\sigma).

In the analogous construction for the unitary case, one obtains a one-to-one correspondence between paths and monotone factorisations, but that is not the case here. Given a monotone factorisation 𝝉\bm{\tau} of σ\sigma, there exists a unique path in 1(𝝉)\mathcal{F}^{-1}(\bm{\tau}) containing only edges of types AA and BB. The number of pairs of consecutive AABB edges in the path is equal to the hive number b(𝝉)b(\bm{\tau}). Any such pair can be replaced by a type CC edge to obtain an element of 1(𝝉)\mathcal{F}^{-1}(\bm{\tau}) and every element of 1(𝝉)\mathcal{F}^{-1}(\bm{\tau}) can be obtained in this way. Thus, we have |1(𝝉)|=2b(𝝉)|\mathcal{F}^{-1}(\bm{\tau})|=2^{b(\bm{\tau})}. Moreover, keeping track of the effect on edge weights, we have the equality

𝝆1(𝝉)(1q)C(𝝆)=(11q)b(𝝉).\sum_{\bm{\rho}\in\mathcal{F}^{-1}(\bm{\tau})}\left(-\frac{1}{q}\right)^{\ell_{C}(\bm{\rho})}=\left(1-\frac{1}{q}\right)^{b(\bm{\tau})}.

These observations allow us to express the coefficients of the large NN expansion of Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) in terms of monotone factorisations via the equation

Wg𝐒(σ)=qkr=0(1N)r𝝉(σ)r(𝝉)=r(11q)b(𝝉).\operatorname{Wg^{\mathbf{S}}}(\sigma)=q^{k}\sum_{r=0}^{\infty}\left(-\frac{1}{N}\right)^{r}\sum_{\begin{subarray}{c}\bm{\tau}\in\mathcal{M}(\sigma)\\ r(\bm{\tau})=r\end{subarray}}\left(1-\frac{1}{q}\right)^{b(\bm{\tau})}.

The discussion above motivates the following definition and theorem, whose proof is immediate after setting t=11qt=1-\frac{1}{q} in the previous equation.

Definition 2.11.

For r0r\geqslant 0 and σ\sigma a permutation, let wrt(σ)\vec{w}^{t}_{r}(\sigma) denote the weighted count of monotone factorisations of σ\sigma, where the weight of a monotone factorisation 𝝉\bm{\tau} is tb(𝝉)t^{b(\bm{\tau})}. Let hrt(σ)\vec{h}^{t}_{r}(\sigma) denote the analogous count restricted to transitive monotone factorisations.

Theorem 2.12 (Large NN expansion).

For a permutation σSk\sigma\in S_{k}, we have the following large NN expansion for fixed t=1NMt=1-\frac{N}{M}.

Wg𝐒(σ)=1(1t)kr=0wrt(σ)(1N)r\operatorname{Wg^{\mathbf{S}}}(\sigma)=\frac{1}{(1-t)^{k}}\sum_{r=0}^{\infty}\vec{w}^{t}_{r}(\sigma)\left(-\frac{1}{N}\right)^{r} (4)

2.3 Representation-theoretic interpretation

The unitary invariance of the Haar measure implies that the Weingarten function Wg𝐒\operatorname{Wg^{\mathbf{S}}} is a function of permutations that is constant on conjugacy classes. It is natural to ask whether it admits a natural description in the class algebra of the symmetric group. Such a description of the unitary Weingarten function Wg𝐔\operatorname{Wg^{\mathbf{U}}} is well understood and given in terms of the Jucys–Murphy elements in the symmetric group algebra [40, 44]. We will show that the Weingarten function Wg𝐒\operatorname{Wg^{\mathbf{S}}} can be expressed similarly.

The Jucys–Murphy elements J1,J2,,JkJ_{1},J_{2},\ldots,J_{k} are elements of the symmetric group algebra defined by

Ji=(1i)+(2i)++(i1i)[Sk],J_{i}=(1\leavevmode\nobreak\ i)+(2\leavevmode\nobreak\ i)+\cdots+(i-1\leavevmode\nobreak\ i)\in\mathbb{C}[S_{k}],

where we interpret the formula for i=1i=1 as J1=0J_{1}=0. They were introduced independently by Jucys [36] and Murphy [41] and their seemingly simple definition belies their remarkable properties. For example, they commute with each other and indeed, generate a maximal commutative subalgebra of [Sk]\mathbb{C}[S_{k}]. Any symmetric function of the Jucys–Murphy elements lies in the class algebra Z[Sk]Z\mathbb{C}[S_{k}] and the class expansions of such expressions are of significant interest, appearing in various contexts [30]. Furthermore, the Jucys–Murphy elements are essential elements of the Okounkov–Vershik approach to the representation theory of symmetric groups [45]. We will subsequently require the following results that date back to the seminal work of Jucys.

Proposition 2.13 (Jucys [36]).
  1. (a)

    The Jucys–Murphy elements J1,J2,,Jk[Sk]J_{1},J_{2},\ldots,J_{k}\in\mathbb{C}[S_{k}] satisfy

    (x+J1)(x+J2)(x+Jk)=σSkx#cycles(σ)σ.(x+J_{1})(x+J_{2})\cdots(x+J_{k})=\sum_{\sigma\in S_{k}}x^{\#\mathrm{cycles}(\sigma)}\,\sigma.
  2. (b)

    Let λ\lambda be a partition of kk and let χλ\chi^{\lambda} the corresponding irreducible character of the symmetric group. We adopt the usual abuse of notation and consider χλ\chi^{\lambda} as an element of the class algebra Z[Sk]Z\mathbb{C}[S_{k}]. If ff is a symmetric polynomial in nn variables, then

    f(J1,J2,,Jk)χλ=f(cont(λ))χλ,f(J_{1},J_{2},\ldots,J_{k})\,\chi^{\lambda}=f(\mathrm{cont}(\lambda))\,\chi^{\lambda},

    where cont(λ)\mathrm{cont}(\lambda) denotes the multiset of contents in the Young diagram for λ\lambda. (The content of a box in row ii and column jj of a Young diagram is the number jij-i.)

It was shown by Novak [44] that the unitary Weingarten function can be naturally expressed in terms of the Jucys–Murphy elements via the formula

σSkWg𝐔(σ)σ=i=1k1N+Ji.\sum_{\sigma\in S_{k}}\operatorname{Wg^{\mathbf{U}}}(\sigma)\,\sigma=\prod_{i=1}^{k}\dfrac{1}{N+J_{i}}.

By considering the right side as a series in 1N-\frac{1}{N}, one observes that the coefficients are homogeneous symmetric functions of the Jucys–Murphy elements. This leads directly to the notion of monotone Hurwitz numbers, which count monotone factorisations of a given permutation with a prescribed length. The analogue of the equation above for the Weingarten function Wg𝐒\operatorname{Wg^{\mathbf{S}}} is the following, which leads to a deformation of the monotone Hurwitz numbers, which are now weighted counts of monotone factorisations with weight equal to tt to the power of the hive number. This idea was already briefly introduced in Definition 2.11, but will be studied in further detail in Section 3.

Proposition 2.14.

For each positive integer kk, we have the following equality in Z[Sk]Z\mathbb{C}[S_{k}], the centre of the symmetric group algebra.

σSkWg𝐒(σ)σ=i=1kM+JiN+Ji\sum_{\sigma\in S_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,\sigma=\prod_{i=1}^{k}\dfrac{M+J_{i}}{N+J_{i}}
Proof.

This is essentially an algebraic reformulation of the orthogonality relations of Theorem 2.4 and we will prove it by induction on kk. The base case k=1k=1 corresponds to the fact that Wg𝐒((1))=MN\operatorname{Wg^{\mathbf{S}}}((1))=\frac{M}{N}, which is an immediate consequence of the orthogonality relation for σ=(1)\sigma=(1).

It remains to show that, for k2k\geqslant 2,

σSkWg𝐒(σ)σ=M+JkN+JkσSk1Wg𝐒(σ)σ,\sum_{\sigma\in S_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,\sigma=\frac{M+J_{k}}{N+J_{k}}\sum_{\sigma\in S_{k-1}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,\sigma^{\uparrow},

where for any permutation σSk1\sigma\in S_{k-1}, we write σSk\sigma^{\uparrow}\in S_{k} to denote the permutation that agrees with σ\sigma on the set {1,2,,k1}\{1,2,\ldots,k-1\} and fixes kk. Consider multiplying both sides of this equation by N+JkN+J_{k} and use the definition of the Jucys–Murphy element JkJ_{k} to show that

(N+Jk)σSkWg𝐒(σ)σ\displaystyle(N+J_{k})\sum_{\sigma\in S_{k}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,\sigma =σSk(NWg𝐒(σ)+i=1k1Wg𝐒((ik)σ))σ,\displaystyle=\sum_{\sigma\in S_{k}}\bigg{(}N\operatorname{Wg^{\mathbf{S}}}(\sigma)+\sum_{i=1}^{k-1}\operatorname{Wg^{\mathbf{S}}}((i\leavevmode\nobreak\ k)\circ\sigma)\bigg{)}\sigma, (5)
(M+Jk)σSk1Wg𝐒(σ)σ\displaystyle(M+J_{k})\sum_{\sigma\in S_{k-1}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,\sigma^{\uparrow} =σSk(δσ(k),kMWg𝐒(σ)+i=1k1δσ(i),kWg𝐒([σ(ik)])σ.\displaystyle=\sum_{\sigma\in S_{k}}\bigg{(}\delta_{\sigma(k),k}\,M\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow})+\sum_{i=1}^{k-1}\delta_{\sigma(i),k}\operatorname{Wg^{\mathbf{S}}}([\sigma\circ(i\leavevmode\nobreak\ k)]^{\downarrow}\bigg{)}\sigma. (6)

The second equality is more subtle than the first and relies on the observation that for 1ik11\leqslant i\leqslant k-1,

σSk1Wg𝐒(σ)(ik)σ=σSk:σ(k)=kWg𝐒(σ)(ik)σ=σSk:σ(i)=kWg𝐒([σ(ik)])σ.\sum_{\sigma\in S_{k-1}}\operatorname{Wg^{\mathbf{S}}}(\sigma)\,(i\leavevmode\nobreak\ k)\circ\sigma^{\uparrow}=\sum_{\sigma\in S_{k}:\sigma(k)=k}\operatorname{Wg^{\mathbf{S}}}(\sigma^{\downarrow})\,(i\leavevmode\nobreak\ k)\circ\sigma=\sum_{\sigma\in S_{k}:\sigma(i)=k}\operatorname{Wg^{\mathbf{S}}}([\sigma\circ(i\leavevmode\nobreak\ k)]^{\downarrow})\,\sigma.

Finally, the desired equality between equations 5 and 6 follows directly from the orthogonality relations of Theorem 2.4, which completes the proof. ∎

Proposition 2.14 implies the following character formula for the Weingarten function.

Corollary 2.15 (Character formula).

Consider a permutation σSk\sigma\in S_{k} and let idSk\mathrm{id}\in S_{k} be the identity. Then

Wg𝐒(σ)=1k!λkχλ(id)χλ(σ)λM+c()N+c(),\operatorname{Wg^{\mathbf{S}}}(\sigma)=\frac{1}{k!}\sum_{\lambda\vdash k}\chi^{\lambda}(\mathrm{id})\,\chi^{\lambda}(\sigma)\prod_{\square\in\lambda}\frac{M+c(\square)}{N+c(\square)},

where c()c(\square) denotes the content of the box \square in a Young diagram of a partition. Here and throughout, we use the notation λk\lambda\vdash k to denote that λ\lambda is a partition of kk.

Proof.

By the orthogonality of characters, the identity in Z[Sk]Z\mathbb{C}[S_{k}] can be expressed as e=1k!λkχλ(id)χλe=\frac{1}{k!}\sum_{\lambda\vdash k}\chi^{\lambda}(\mathrm{id})\,\chi^{\lambda}. Use part (b) of Proposition 2.13 to write

i=1kM+JiN+Jie=1k!λk(λM+c()N+c())χλ(id)χλ.\prod_{i=1}^{k}\frac{M+J_{i}}{N+J_{i}}\cdot e=\frac{1}{k!}\sum_{\lambda\vdash k}\left(\prod_{\square\in\lambda}\dfrac{M+c(\square)}{N+c(\square)}\right)\chi^{\lambda}(\mathrm{id})\,\chi^{\lambda}.

By Proposition 2.14, Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) is the coefficient of σ\sigma in the above expression, and the result follows. ∎

In summary, integrals on the space 𝐒(M,N)\mathbf{S}(M,N) of matrices admit a convolution formula involving the Weingarten function Wg𝐒\operatorname{Wg^{\mathbf{S}}}. The Weingarten function is in turn determined by orthogonality relations, from which it follows that its values have a representation-theoretic interpretation in terms of Jucys–Murphy elements. An alternative perspective shows that the large NN expansion of the Weingarten function for fixed t=1NMt=1-\frac{N}{M} has coefficients that are weighted counts of monotone factorisations. In the next section, we investigate the combinatorics of these enumerations in further detail.

3 Deformed monotone Hurwitz numbers

3.1 Deformed monotone Hurwitz numbers

Monotone Hurwitz numbers enumerate monotone factorisations of permutations and arise as coefficients in the large NN expansion of the unitary Weingarten function [33]. Weingarten calculus on the space 𝐒(M,N)\mathbf{S}(M,N) naturally motivates a deformation of the monotone Hurwitz numbers, obtained by counting with a weight equal to tt to the power of the hive number. This construction produces a family of polynomials with remarkable properties.

Recall from Definition 2.11 that wrt(σ)\vec{w}^{t}_{r}(\sigma) denotes the weighted count of monotone factorisations of σ\sigma, while hrt(σ)\vec{h}^{t}_{r}(\sigma) restricts the count to transitive monotone factorisations. To fit the usual nomenclature concerning Hurwitz-type problems, we introduce a new notation to reindex by “topology”, consider the enumeration as a function on cycle type, and normalise by the product of cycle lengths.

Definition 3.1 (Deformed monotone Hurwitz numbers).

For μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1, let σ\sigma be any permutation with nn cycles of lengths μ1,,μn\mu_{1},\ldots,\mu_{n} and define

Wg,nt(μ1,,μn)\displaystyle\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) =1μ1μnw|μ|+2g2+nt(σ),\displaystyle=\frac{1}{\mu_{1}\cdots\mu_{n}}\,\vec{w}^{t}_{|\mu|+2g-2+n}(\sigma),
Hg,nt(μ1,,μn)\displaystyle\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) =1μ1μnh|μ|+2g2+nt(σ).\displaystyle=\frac{1}{\mu_{1}\cdots\mu_{n}}\,\vec{h}^{t}_{|\mu|+2g-2+n}(\sigma).

Here and throughout, we use the notation |μ||\mu| as a shorthand for the sum μ1++μn\mu_{1}+\cdots+\mu_{n}. We refer to Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) as a disconnected deformed monotone Hurwitz number and Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) as a connected deformed monotone Hurwitz number.

Remark 3.2.

The pair (g,n)(g,n) here can be interpreted as encoding the topology of a surface, with gg denoting the genus and nn the number of punctures, or marked points. A monotone factorisation (τ1,τ2,,τr)(\tau_{1},\tau_{2},\ldots,\tau_{r}) of σ\sigma can be interpreted as the monodromy of a branched cover 𝒮1\mathcal{S}\to\mathbb{CP}^{1} of Riemann surfaces, with σ\sigma representing the monodromy over 1\infty\in\mathbb{CP}^{1}. So Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) and Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) enumerate certain branched covers of 1\mathbb{CP}^{1} by a genus gg surface with nn preimages of 1\infty\in\mathbb{CP}^{1}, the latter restricting the enumeration to connected covers. Consistent with this interpretation, we have that Hg,nt(μ1,,μn)=0\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})=0 unless gg is a non-negative integer, while Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) can be non-zero when gg is a negative integer. Note that the genus of a disconnected surface may be negative, since we consider the Euler characteristic 22g2-2g to be additive over disjoint union, rather than the genus itself.

The character formula of Corollary 2.15 translates into one for deformed monotone Hurwitz numbers as follows.

Proposition 3.3 (Character formula).

Let [r]F()[\hbar^{r}]F(\hbar) denote the coefficient of r\hbar^{r} in the series for F()F(\hbar) at =0\hbar=0 and let χμλ\chi^{\lambda}_{\mu} denote the value of the symmetric group character χλ\chi^{\lambda} on a permutation of cycle type μ\mu. Then

Wg,nt(μ1,,μn)=1μ1μn[|μ|+2g2+n]λ|μ|χ111λχμλ|μ|!λ1c()+tc()1c().\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})=\frac{1}{\mu_{1}\cdots\mu_{n}}\,\big{[}\hbar^{|\mu|+2g-2+n}\big{]}\sum_{\lambda\vdash|\mu|}\frac{\chi^{\lambda}_{11\cdots 1}\,\chi^{\lambda}_{\mu}}{|\mu|!}\prod_{\square\in\lambda}\frac{1-\hbar\,c(\square)+t\hbar\,c(\square)}{1-\hbar\,c(\square)}.
Proof.

Equate the expressions for Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) in terms of monotone factorisations (Theorem 2.12) and characters of the symmetric group (Corollary 2.15), using the notation =1N\hbar=-\frac{1}{N} and t=1NMt=1-\frac{N}{M}.

1(1t)kr=0wrt(σ)r=1k!λkχλ(id)χλ(σ)λ1c()+tc()(1t)(1c())\frac{1}{(1-t)^{k}}\sum_{r=0}^{\infty}\vec{w}^{t}_{r}(\sigma)\,\hbar^{r}=\frac{1}{k!}\sum_{\begin{subarray}{c}\lambda\vdash k\end{subarray}}\chi^{\lambda}(\mathrm{id})\,\chi^{\lambda}(\sigma)\prod_{\square\in\lambda}\frac{1-\hbar\,c(\square)+t\hbar\,c(\square)}{(1-t)(1-\hbar\,c(\square))}

The desired result is obtained by multiplying through by (1t)k(1-t)^{k}, extracting the coefficient of |μ|+2g2+n\hbar^{|\mu|+2g-2+n} from both sides, and using Definition 3.1 for Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}). ∎

The family of deformed monotone Hurwitz numbers is stored in the large NN expansion of the following matrix integral, which we interpret as the partition function for the enumeration. As usual, the partition function naturally stores the disconnected enumeration, while its logarithm stores the connected enumeration.

Proposition 3.4 (Matrix integral).

The large NN expansion of the formal matrix integral below is a partition function for the deformed monotone Hurwitz numbers. Here, we use the notation =1N\hbar=-\frac{1}{N} and pip_{i} represents the iith power sum symmetric function, evaluated on the eigenvalues of the N×NN\times N complex matrix AA. (It is common to see a power of 2g2+n\hbar^{2g-2+n} in the partition function — the extra |μ|\hbar^{|\mu|} here can be removed by rescaling.)

𝐒(M,N)expNtr(AS)MdS\displaystyle\int_{\mathbf{S}(M,N)}\exp\frac{N\,\mathrm{tr}(AS)}{M}\,\mathrm{d}S =1+g=n=1μ1,,μn=1Wg,nt(μ1,,μn)|μ|+2g2+nn!pμ1pμn\displaystyle=1+\sum_{g=-\infty}^{\infty}\sum_{n=1}^{\infty}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\,\frac{\hbar^{|\mu|+2g-2+n}}{n!}\,p_{\mu_{1}}\cdots p_{\mu_{n}}
=exp[g=0n=1μ1,,μn=1Hg,nt(μ1,,μn)|μ|+2g2+nn!pμ1pμn]\displaystyle=\exp\Bigg{[}\sum_{g=0}^{\infty}\sum_{n=1}^{\infty}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\,\frac{\hbar^{|\mu|+2g-2+n}}{n!}\,p_{\mu_{1}}\cdots p_{\mu_{n}}\Bigg{]}
Remark 3.5.

Recall that the parameter tt is encoded in the parameters of the space 𝐒(M,N)\mathbf{S}(M,N) via the relation t=1NMt=1-\frac{N}{M}. The usual monotone Hurwitz numbers are recovered from their deformed counterparts defined above by setting t=1t=1. Perhaps surprisingly, this particular value of tt does not correspond to valid parameters and MM and NN in the matrix integral interpretation. It would be interesting to have a more direct connection between integration over 𝐔(N)\mathbf{U}(N) and 𝐒(M,N)\mathbf{S}(M,N).

Remark 3.6.

It would also be natural to consider “double” deformed monotone Hurwitz numbers that take two partitions as arguments, rather than one. These enumerate monotone factorisations whose product with a permutation of cycle type given by the first partition produces a permutation of cycle type given by the second. Although this “double” enumeration deserves further attention, we refrain from developing this theory in the present work, since they do not give rise to polynomials with the same remarkable properties as the “single” enumeration.

3.2 Cut-and-join recursion

The notion of cut-and-join analysis was originally developed for single Hurwitz numbers, before being adapted to work in the monotone case [34, 32]. Deformed monotone Hurwitz numbers are amenable to a similar analysis, resulting in the following recursion.

Theorem 3.7 (Cut-and-join recursion).

Apart from the initial condition H0,1t(1)=1\vec{H}^{t}_{0,1}(1)=1, the deformed monotone Hurwitz numbers satisfy

μ1Hg,nt(μ1,μS)\displaystyle\mu_{1}\vec{H}^{t}_{g,n}(\mu_{1},\mu_{S}) =i=2n(μ1+μi)Hg,n1t(μ1+μi,μS{i})+(t1)(μ11)Hg,nt(μ11,μS)\displaystyle=\sum_{i=2}^{n}(\mu_{1}+\mu_{i})\vec{H}^{t}_{g,n-1}(\mu_{1}+\mu_{i},\mu_{S\setminus\{i\}})+(t-1)(\mu_{1}-1)\vec{H}^{t}_{g,n}(\mu_{1}-1,\mu_{S})
+α+β=μ1αβ[Hg1,n+1t(α,β,μS)+g1+g2=gI1I2=SHg1,|I1|+1t(α,μI1)Hg2,|I2|+1t(β,μI2)],\displaystyle+\sum_{\alpha+\beta=\mu_{1}}\alpha\beta\Bigg{[}\vec{H}^{t}_{g-1,n+1}(\alpha,\beta,\mu_{S})+\sum_{\begin{subarray}{c}g_{1}+g_{2}=g\\ I_{1}\sqcup I_{2}=S\end{subarray}}\vec{H}^{t}_{g_{1},|I_{1}|+1}(\alpha,\mu_{I_{1}})\,\vec{H}^{t}_{g_{2},|I_{2}|+1}(\beta,\mu_{I_{2}})\Bigg{]}, (7)

where we use the notation S={2,3,,n}S=\{2,3,\ldots,n\} and μI={μi1,μi2,,μik}\mu_{I}=\{\mu_{i_{1}},\mu_{i_{2}},\ldots,\mu_{i_{k}}\} for I={i1,i2,,ik}I=\{i_{1},i_{2},\ldots,i_{k}\}.

Proof.

The proof is based on the case for the usual monotone Hurwitz numbers [32], with some additional care required to keep track of the deformation parameter tt. Consider multiplying Theorem 3.7 by μ2μn\mu_{2}\cdots\mu_{n} and consider the right side to be composed of four terms in the obvious way.

Fix a permutation σSk\sigma\in S_{k} of cycle type (μ1,,μn)(\mu_{1},\ldots,\mu_{n}) and consider the quantity hr+1t(σ)\vec{h}^{t}_{r+1}(\sigma) for some r0r\geqslant 0. Note that a transitive monotone factorisation 𝝉=(τ1,τ2,,τr+1)\bm{\tau}=(\tau_{1},\tau_{2},\ldots,\tau_{r+1}) of σ\sigma must have τr+1=(ak)\tau_{r+1}=(a\leavevmode\nobreak\ k) for some 1ak11\leqslant a\leqslant k-1. So a transitive monotone factorisation 𝝉\bm{\tau} of σ\sigma with length r+1r+1 is equivalent to a monotone factorisation 𝝉\bm{\tau}^{\prime} of σ(ak)\sigma\circ(a\leavevmode\nobreak\ k) with length rr for some 1ak11\leqslant a\leqslant k-1, where 𝝉,(ak)Sk\langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle\leqslant S_{k} is transitive. This can be expressed via the equation

hr+1t(σ)=𝝉r+1(σ)𝝉 transitivetb(𝝉)=a=1k1𝝉r(σ(ak))𝝉,(ak) transitivet|𝒃(𝝉){k}|,\vec{h}^{t}_{r+1}(\sigma)=\sum_{\begin{subarray}{c}\bm{\tau}\in\mathcal{M}_{r+1}(\sigma)\\ \langle\bm{\tau}\rangle\text{ transitive}\end{subarray}}t^{b(\bm{\tau})}=\sum_{a=1}^{k-1}\sum_{\begin{subarray}{c}\bm{\tau}^{\prime}\in\mathcal{M}_{r}(\sigma\circ(a\leavevmode\nobreak\ k))\\ \langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle\text{ transitive}\end{subarray}}t^{|\bm{b}(\bm{\tau}^{\prime})\cup\{k\}|},

where we introduce the boldface notation 𝒃(𝝉)\bm{b}(\bm{\tau}) to denote the set {b1,b2,,br}\{b_{1},b_{2},\ldots,b_{r}\}, excluding multiplicities, for 𝝉=((a1b1),(a2b2),,(arbr))\bm{\tau}=((a_{1}\leavevmode\nobreak\ b_{1}),(a_{2}\leavevmode\nobreak\ b_{2}),\ldots,(a_{r}\leavevmode\nobreak\ b_{r})).

The sum on the right side can be broken down into further sums, depending on various cases. For a fixed value of aa, either aa is in the same cycle of σ\sigma as kk, or aa is in a different cycle. The transposition (ak)(a\leavevmode\nobreak\ k) is referred to as a cut or a join of σ\sigma depending on these two cases, respectively. Moreover, if (ak)(a\leavevmode\nobreak\ k) is a join of σ\sigma, then any monotone factorisation 𝝉\bm{\tau}^{\prime} of σ(ak)\sigma\circ(a\leavevmode\nobreak\ k), with 𝝉,(ak)\langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle transitive, must be transitive itself. Based on these considerations, each term in the equation above falls into one of three cases: for each 1ak11\leqslant a\leqslant k-1 and 𝝉r(σ(ak))\bm{\tau}^{\prime}\in\mathcal{M}_{r}(\sigma\circ(a\leavevmode\nobreak\ k)) with 𝝉,(ak)\langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle transitive, either

  • (ak)(a\leavevmode\nobreak\ k) is a join of σ\sigma and 𝝉Sk\langle\bm{\tau}^{\prime}\rangle\leqslant S_{k} is transitive;

  • (ak)(a\leavevmode\nobreak\ k) is a cut of σ\sigma and 𝝉Sk\langle\bm{\tau}^{\prime}\rangle\leqslant S_{k} is transitive; or

  • (ak)(a\leavevmode\nobreak\ k) is a cut of σ\sigma and 𝝉Sk\langle\bm{\tau}^{\prime}\rangle\leqslant S_{k} is not transitive.

The first two cases can be expressed as one term to give the equation

hr+1t(σ)=a=1k1hrt(σ(ak))+a=1(ak) cuts σk1𝝉r(σ(ak))𝝉,(ak) transitive𝝉 not transitivet|𝒃(𝝉){k}|.\vec{h}^{t}_{r+1}(\sigma)=\sum_{a=1}^{k-1}\vec{h}^{t}_{r}(\sigma\circ(a\leavevmode\nobreak\ k))+\sum_{\begin{subarray}{c}a=1\\ (a\leavevmode\nobreak\ k)\text{ cuts }\sigma\end{subarray}}^{k-1}\sum_{\begin{subarray}{c}\bm{\tau}^{\prime}\in\mathcal{M}_{r}(\sigma\circ(a\leavevmode\nobreak\ k))\\ \langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle\text{ transitive}\\ \langle\bm{\tau}^{\prime}\rangle\text{ not transitive}\end{subarray}}t^{|\bm{b}(\bm{\tau}^{\prime})\cup\{k\}|}. (8)

In the usual notation for deformed monotone Hurwitz numbers, the first term here precisely gives rise to the first and third terms of Theorem 3.7, while the second term here almost gives rise to the fourth term of Theorem 3.7. The remainder of the proof explains the meaning of “almost” here and how the second term of Theorem 3.7 accounts correctly for this anomaly.

If 𝝉\bm{\tau}^{\prime} falls into the third case for some value of 1ak11\leqslant a\leqslant k-1, then the transitive orbit of 𝝉,(ak)\langle\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)\rangle is split into two orbits of 𝝉\langle\bm{\tau}^{\prime}\rangle — one containing aa and one containing kk. In fact, these orbits are given by a partition of the disjoint cycles of σ(ak)\sigma\circ(a\leavevmode\nobreak\ k) into two classes, thus giving rise to the quadratic terms in Theorem 3.7. The only instance that b(𝝉)b(\bm{\tau}^{\prime}) and b(𝝉,(ak))b(\bm{\tau}^{\prime},(a\leavevmode\nobreak\ k)) differ is when kk is in an orbit of size 11 under 𝝉\langle\bm{\tau}^{\prime}\rangle, which then requires an additional weight of tt to be contributed. The t1t-1 factor in the second term of Theorem 3.7 precisely handles this adjustment, since we wish to remove one of the H0,1t(1)Hg,nt(μ11,μS)\vec{H}^{t}_{0,1}(1)\,\vec{H}^{t}_{g,n}(\mu_{1}-1,\vec{\mu}_{S}) contributions appearing in the fourth term and weight it by an additional factor of tt.

Thus, in the correct final accounting of all terms, we see that the first term of equation 8 corresponds to the first and third terms of Theorem 3.7, while the second term of equation 8 corresponds to the second and fourth terms of Theorem 3.7. ∎

The cut-and-join recursion provides an effective algorithm for calculating deformed monotone Hurwitz numbers, which is more efficient than naive approaches. With this improved computational power comes the ability to make large-scale empirical observations on the structure of the deformed monotone Hurwitz numbers and a recursive means to prove them. The most evident of these observations are the symmetric and unimodal nature of the coefficients of Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}).

Adopting the terminology of Brenti [7] and Zeilberger [50], we define the following.

Definition 3.8.

A polynomial P(t)=a0+a1t+a2t2++antnP(t)=a_{0}+a_{1}t+a_{2}t^{2}+\cdots+a_{n}t^{n} with real coefficients is said to be:

  • symmetric if the sequence ,0,0,a0,a1,a2,,an,0,0,\ldots,0,0,a_{0},a_{1},a_{2},\ldots,a_{n},0,0,\ldots is palindromic;

  • unimodal if there exists an integer kk such that a0a1akak+1ana_{0}\leqslant a_{1}\leqslant\cdots\leqslant a_{k}\geqslant a_{k+1}\geqslant\cdots\geqslant a_{n}; and

  • a Λ\Lambda-polynomial if it is a non-zero polynomial with non-negative coefficients that is both palindromic and unimodal.

If PP is a Λ\Lambda-polynomial, then there exists a unique integer dar(P)\mathrm{dar}(P) such that P(t)=tdar(P)P(t1)P(t)=t^{\mathrm{dar}(P)}P(t^{-1}). The quantity dar(P)\mathrm{dar}(P) is called the darga of PP.

Proposition 3.9.

For g0g\geqslant 0, n1n\geqslant 1 and |μ|2|\mu|\geqslant 2, the deformed monotone Hurwitz number Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) is a Λ\Lambda-polynomial of degree |μ|1|\mu|-1 and darga |μ||\mu|.

Proof.

We use strong induction on the value of r=|μ|+2g2+n1r=|\mu|+2g-2+n\geqslant 1. The only deformed monotone Hurwitz number corresponding to r=1r=1 is H0,1t(2)=12t\vec{H}^{t}_{0,1}(2)=\frac{1}{2}t, which is indeed a Λ\Lambda-polynomial of degree 11 and darga 22. Now consider a deformed monotone Hurwitz number Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) corresponding to r2r\geqslant 2 and rewrite the cut-and-join recursion of Theorem 3.7 as

μ1Hg,nt(μ1,μS)\displaystyle\mu_{1}\vec{H}^{t}_{g,n}(\mu_{1},\mu_{S}) =i=2n(μ1+μi)Hg,n1t(μ1+μi,μS{i})+(t+1)(μ11)Hg,nt(μ11,μS)\displaystyle=\sum_{i=2}^{n}(\mu_{1}+\mu_{i})\vec{H}^{t}_{g,n-1}(\mu_{1}+\mu_{i},\mu_{S\setminus\{i\}})+(t+1)(\mu_{1}-1)\vec{H}^{t}_{g,n}(\mu_{1}-1,\mu_{S})
+α+β=μ1αβ[Hg1,n+1t(α,β,μS)+g1+g2=gI1I2=Sno H0,1t(1)Hg1,|I1|+1t(α,μI1)Hg2,|I2|+1t(β,μI2)].\displaystyle+\sum_{\alpha+\beta=\mu_{1}}\alpha\beta\Bigg{[}\vec{H}^{t}_{g-1,n+1}(\alpha,\beta,\mu_{S})+\sum_{\begin{subarray}{c}g_{1}+g_{2}=g\\ I_{1}\sqcup I_{2}=S\end{subarray}}^{\text{no }\vec{H}^{t}_{0,1}(1)}\vec{H}^{t}_{g_{1},|I_{1}|+1}(\alpha,\mu_{I_{1}})\,\vec{H}^{t}_{g_{2},|I_{2}|+1}(\beta,\mu_{I_{2}})\Bigg{]}.

Here, we have simply removed the two terms including H0,1t(1)\vec{H}^{t}_{0,1}(1) from the final summation and incorporated them into the second term on the right side.

By the inductive hypothesis, all deformed monotone Hurwitz numbers appearing on the right side of the cut-and-join recursion are Λ\Lambda-polynomials. To prove that Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) is also one, we rely on the following closure properties of Λ\Lambda-polynomials, proofs of which can be found in [47].

  • If PP and QQ are Λ\Lambda-polynomials, then the product PQPQ is a Λ\Lambda-polynomial with dar(PQ)=dar(P)+dar(Q)\mathrm{dar}(PQ)=\mathrm{dar}(P)+\mathrm{dar}(Q).

  • If PP and QQ are Λ\Lambda-polynomials of the same darga dd, then P+QP+Q is a Λ\Lambda-polynomial of darga dd.

It follows that each of the four terms on the right side of the equation above are Λ\Lambda-polynomials of darga |μ||\mu|, or possibly equal to the zero polynomial. So the entire right side, and hence Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}), is a Λ\Lambda-polynomial of darga |μ||\mu|.

For any permutation σSk\sigma\in S_{k} for k2k\geqslant 2, one can construct a transitive monotone factorisation of σ\sigma with hive number 11. So the polynomial Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) has a non-zero linear term, but no constant term. Combined with the fact that it is a Λ\Lambda-polynomial of darga |μ||\mu|, it follows that Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) is a polynomial of degree |μ|1|\mu|-1. ∎

Remark 3.10.

We have thus far provided two interpretations for the polynomials that we refer to as deformed monotone Hurwitz numbers — one as weighted counts of monotone factorisations (Definition 3.1) and the other as coefficients in the large NN expansion of a matrix integral (Proposition 3.4). The symmetry of these polynomials does not appear to be immediately evident from either of these manifestations. In the matrix integral interpretation, the transformation t1tt\mapsto\frac{1}{t} encodes the transformation MNMM\mapsto N-M. This is natural from the perspective of integration on the Grassmannian, since Gr(M,N)Gr(NM,N)\mathrm{Gr}(M,N)\cong\mathrm{Gr}(N-M,N), although further investigation of this symmetry is warranted. In the monotone factorisation interpretation, the symmetry of the polynomials implies that the number of transitive monotone factorisations of a permutation σSk\sigma\in S_{k} with hive number hh is equal to the number of transitive monotone factorisations of σ\sigma with hive number khk-h. This does not appear to be immediately obvious, so it would be interesting to have a direct combinatorial proof of this fact. It is worth remarking that the disconnected enumeration Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) does not lead to symmetric polynomials, so the transitivity condition is important here.

Remark 3.11.

There are various other properties of polynomial coefficients that are often mentioned alongside symmetry and unimodality. The deformed monotone Hurwitz numbers constitute a family of polynomials that appears to satisfy many of these. As examples, we pose the following questions. Do the coefficients of the deformed monotone Hurwitz numbers exhibit log-concavity? Do they exhibit asymptotic normality?

As we will see in Section 4, deformed monotone Hurwitz numbers belong to a large class of enumerative problems governed by the topological recursion. In many such instances, the one-point invariants — in other words, those with n=1n=1 — are governed by a recursion that is linear, rather than quadratic like the cut-and-join recursion. In previous work of Chaudhuri and the second author [9], it was shown that such one-point recursions exist for “weighted Hurwitz numbers”, to use the terminology of Alexandrov, Chapuy, Eynard and Harnad [1]. Furthermore, they gave an explicit algorithmic approach to obtain these recursions that is effective in many examples. In the case of deformed monotone Hurwitz numbers, one obtains the following result.

Theorem 3.12 (One-point recursion).

The one-point deformed monotone Hurwitz numbers — in other words, those with n=1n=1 — satisfy

d2Hg,1t(d)=(d1)(2d3)(t+1)Hg,1t(d1)(d2)(d3)(t1)2Hg,1t(d2)+d2(d1)2Hg1,1t(d).d^{2}\,\vec{H}^{t}_{g,1}(d)=(d-1)(2d-3)(t+1)\,\vec{H}^{t}_{g,1}(d-1)-(d-2)(d-3)(t-1)^{2}\,\vec{H}^{t}_{g,1}(d-2)+d^{2}(d-1)^{2}\,\vec{H}^{t}_{g-1,1}(d).

Observe that setting t=1t=1 above recovers the known one-point recursion for monotone Hurwitz numbers [9]. Furthermore, setting g=0g=0 and combining with equation 1 recovers the known linear recursion for Narayana polynomials [31].

3.3 Interlacing phenomena

Root conjectures

The cut-and-join recursion of Theorem 3.7 can be used to effectively compute a large number of deformed monotone Hurwitz numbers, some of which are shown in Appendix A. We previously stated in Proposition 3.9 that the coefficients of these polynomials are symmetric and unimodal. We now turn our attention to their roots, which exhibit rather striking behaviour that remains largely conjectural at present. The most apparent property concerning roots of deformed monotone Hurwitz numbers is the following.

Conjecture 3.13 (Real-rootedness).

For all g0g\geqslant 0, n1n\geqslant 1 and μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1, the deformed monotone Hurwitz number Hg,nt(μ1,μ2,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}) is a real-rooted polynomial in tt.

The roots of the deformed monotone Hurwitz numbers are not only real, but also possess interesting structure relative to each other. We say that a polynomial PP interlaces a polynomial QQ if

  • the degree of PP is nn and the degree of QQ is n+1n+1 for some positive integer nn;

  • PP has nn real roots a1a2ana_{1}\leqslant a_{2}\leqslant\cdots\leqslant a_{n} and QQ has n+1n+1 real roots b1b2bn+1b_{1}\leqslant b_{2}\leqslant\cdots\leqslant b_{n+1}, allowing for multiplicity; and

  • b1a1b2a2bnanbn+1b_{1}\leqslant a_{1}\leqslant b_{2}\leqslant a_{2}\leqslant\cdots\leqslant b_{n}\leqslant a_{n}\leqslant b_{n+1}.

If the inequalities above are strict, then we say that the polynomial PP strictly interlaces the polynomial QQ. By convention, we will also say that a polynomial PP (strictly) interlaces a polynomial QQ if PP is constant and QQ is affine.

It is known that the sequence of Narayana polynomials interlace in the sense that Narμ(t)\mathrm{Nar}_{\mu}(t) interlaces Narμ+1(t)\mathrm{Nar}_{\mu+1}(t) for every positive integer μ\mu [31]. Given equation 1, one may wonder whether an analogous property persists more generally across the whole family of deformed monotone Hurwitz numbers. Overwhelming empirical evidence suggests that this is indeed the case and we have the following.

Conjecture 3.14 (Interlacing).

The polynomial Hg,nt(μ1,μ2,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}) interlaces each of the nn polynomials

Hg,nt(μ1+1,μ2,,μn),Hg,nt(μ1,μ2+1,,μn),,Hg,nt(μ1,μ2,,μn+1).\vec{H}^{t}_{g,n}(\mu_{1}+1,\mu_{2},\ldots,\mu_{n}),\quad\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2}+1,\ldots,\mu_{n}),\quad\ldots,\quad\vec{H}^{t}_{g,n}(\mu_{1},\mu_{2},\ldots,\mu_{n}+1).

Conjecture 3.14 states that for fixed (g,n)(g,n), one obtains a lattice of interlacing polynomials. It has been checked computationally for many cases, including the following, amounting to 1430 independent checks:

  • g{0,1}g\in\{0,1\}, n{1,2,3,4,5}n\in\{1,2,3,4,5\}, |μ|15|\mu|\leqslant 15;

  • g{2,3}g\in\{2,3\}, n{1,2,3,4,5}n\in\{1,2,3,4,5\}, |μ|12|\mu|\leqslant 12;

  • g{4,5}g\in\{4,5\}, n{1,2,3,4,5}n\in\{1,2,3,4,5\}, |μ|10|\mu|\leqslant 10.

One can observe rich structure in the roots of the deformed monotone Hurwitz numbers and write down further conjectures. As an example, consider the following, which asserts that the roots of Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) behave well for fixed μ1,,μn\mu_{1},\ldots,\mu_{n} and increasing gg. A great deal of data can be generated to support this conjecture, some examples of which appear in the tables of Figures 2 and 3.

Conjecture 3.15.

Fix positive integers μ1,,μn\mu_{1},\ldots,\mu_{n} whose sum is dd. As gg\to\infty, the roots of the polynomial Hg,nt(μ1,,μn)\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}), in order from smallest to largest, respectively approach the values

d21,d32,d43,,2d3,1d2, 0.-\frac{d-2}{1},\leavevmode\nobreak\ \leavevmode\nobreak\ -\frac{d-3}{2},\leavevmode\nobreak\ \leavevmode\nobreak\ -\frac{d-4}{3},\leavevmode\nobreak\ \leavevmode\nobreak\ \ldots,\leavevmode\nobreak\ \leavevmode\nobreak\ -\frac{2}{d-3},\leavevmode\nobreak\ \leavevmode\nobreak\ -\frac{1}{d-2},\leavevmode\nobreak\ \leavevmode\nobreak\ 0.

Moreover, the convergence to a number less than 1-1 is increasing from below, while the convergence to a non-zero number greater than 1-1 is decreasing from above.

(μ1,,μn)(\mu_{1},\ldots,\mu_{n}) α1\alpha_{1} α2\alpha_{2} α3\alpha_{3} α4\alpha_{4} α5\alpha_{5} α6\alpha_{6}
(7)(7) -5.0012679418 -2.0003283655 1-1 -0.49991792208 -0.19994929518 0
(6,1)(6,1) -5.0012679418 -2.0003283655 1-1 -0.49991792208 -0.19994929518 0
(5,2)(5,2) -5.0010564352 -2.0002736067 1-1 -0.49993160767 -0.19995775151 0
(5,1,1)(5,1,1) -5.0012326847 -2.0003192382 1-1 -0.49992020316 -0.19995070476 0
(4,3)(4,3) -5.0010564383 -2.0002736143 1-1 -0.49993160576 -0.19995775139 0
(4,2,1)(4,2,1) -5.0010564362 -2.0002736092 1-1 -0.49993160703 -0.19995775147 0
(4,1,1,1)(4,1,1,1) -5.0011739286 -2.0003040277 1-1 -0.49992400462 -0.19995305387 0
(3,3,1)(3,3,1) -5.0010564383 -2.0002736143 1-1 -0.49993160576 -0.19995775139 0
(3,2,2)(3,2,2) -5.0008802353 -2.0002279852 1-1 -0.49994301017 -0.19996479678 0
(3,2,1,1)(3,2,1,1) -5.0010270659 -2.0002660064 1-1 -0.49993350723 -0.19995892579 0
(3,1,1,1,1)(3,1,1,1,1) -5.0011004921 -2.0002850163 1-1 -0.49992875605 -0.19995599000 0
(2,2,2,1)(2,2,2,1) -5.0008802353 -2.0002279852 1-1 -0.49994301017 -0.19996479678 0
(2,2,1,1,1)(2,2,1,1,1) -5.0009781178 -2.0002533320 1-1 -0.49993667500 -0.19996088293 0
(2,1,1,1,1,1)(2,1,1,1,1,1) -5.0010189060 -2.0002638930 1-1 -0.49993403543 -0.19995925206 0
(1,1,1,1,1,1,1)(1,1,1,1,1,1,1) -5.0010189060 -2.000263893081 1-1 -0.49993403543 -0.19995925206 0
Figure 2: The roots α1α2α6\alpha_{1}\leqslant\alpha_{2}\leqslant\cdots\leqslant\alpha_{6} of H20,nt(μ1,,μn)\vec{H}^{t}_{20,n}(\mu_{1},\ldots,\mu_{n}) for all μ1,,μn\mu_{1},\ldots,\mu_{n} satisfying |μ|=7|\mu|=7, to 10 decimal places. Observe the proximity of the numbers in each column to 51,42,33,24,15,0-\frac{5}{1},-\frac{4}{2},-\frac{3}{3},-\frac{2}{4},-\frac{1}{5},0, as predicted by Conjecture 3.15.
gg α1\alpha_{1} α2\alpha_{2} α3\alpha_{3} α4\alpha_{4} α5\alpha_{5} α6\alpha_{6}
1010 5.041604716958-5.041604716958 2.010612015758-2.010612015758 1-1 0.4973609986225-0.4973609986225 0.1983495446670-0.1983495446670 0
1111 5.028663679645-5.028663679645 2.007345500817-2.007345500817 1-1 0.4981703446630-0.4981703446630 0.1988599882007-0.1988599882007 0
1212 5.019792253540-5.019792253540 2.005088769701-2.005088769701 1-1 0.4987310363066-0.4987310363066 0.1992114313684-0.1992114313684 0
1313 5.013688662391-5.013688662391 2.003527619463-2.003527619463 1-1 0.4991196479078-0.4991196479078 0.1994539484474-0.1994539484474 0
1414 5.009478345470-5.009478345470 2.002446572250-2.002446572250 1-1 0.4993891042376-0.4993891042376 0.1996215835335-0.1996215835335 0
1515 5.006568518035-5.006568518035 2.001697414872-2.001697414872 1-1 0.4995760061286-0.4995760061286 0.1997376039891-0.1997376039891 0
1616 5.004554730409-5.004554730409 2.001177961094-2.001177961094 1-1 0.4997056830732-0.4997056830732 0.1998179765971-0.1998179765971 0
1717 5.003159687696-5.003159687696 2.000817629297-2.000817629297 1-1 0.4997956762061-0.4997956762061 0.1998736923107-0.1998736923107 0
1818 5.002192595245-5.002192595245 2.000567599393-2.000567599393 1-1 0.4998581404112-0.4998581404112 0.19991233463311-0.19991233463311 0
1919 5.001521834116-5.001521834116 2.000394067634-2.000394067634 1-1 0.4999015024988-0.4999015024988 0.1999391451575-0.1999391451575 0
2020 5.001056436287-5.001056436287 2.000273609283-2.000273609283 1-1 0.4999316070356-0.4999316070356 0.1999577514750-0.1999577514750 0
Figure 3: The roots α1α2α6\alpha_{1}\leqslant\alpha_{2}\leqslant\cdots\leqslant\alpha_{6} of Hg,3t(4,2,1)\vec{H}^{t}_{g,3}(4,2,1) for g=10,11,12,,20g=10,11,12,\ldots,20, to 12 decimal places. Observe the monotonic convergence of the numbers in each column to 51,42,33,24,15,0-\frac{5}{1},-\frac{4}{2},-\frac{3}{3},-\frac{2}{4},-\frac{1}{5},0, as predicted by Conjecture 3.15.

An interlacing result

There is a rich theory concerning interlacing polynomials, as evidenced by the tome of Fisk [31]. The following lemma is a slight adaptation of [31, Lemma 1.82], and will be used to prove the (g,n)=(0,1)(g,n)=(0,1) and (g,n)=(1,1)(g,n)=(1,1) cases of Conjectures 3.13 and 3.14.

Lemma 3.16.

Let f1(t),f2(t),f_{1}(t),f_{2}(t),\ldots be a sequence of polynomials with non-negative coefficients, such that degfi=i\deg f_{i}=i. Suppose that f1(t)f_{1}(t) strictly interlaces f2(t)f_{2}(t), and that the sequence of polynomials satisfies the relation

fd+1(t)=d(t)fd(t)qd(t)fd1(t),f_{d+1}(t)=\ell_{d}(t)\,f_{d}(t)-q_{d}(t)\,f_{d-1}(t), (9)

where d(t)\ell_{d}(t) is an affine function and qd(t)q_{d}(t) is a quadratic function that is positive for t0t\leqslant 0. Then all polynomials in the sequence are real-rooted and fi(t)f_{i}(t) strictly interlaces fi+1(t)f_{i+1}(t) for every positive integer ii.

Proof.

Suppose that fd1(t)f_{d-1}(t) strictly interlaces fd(t)f_{d}(t). Since fd(t)f_{d}(t) has non-negative integer coefficients, its roots can be written as 0r1>r2>>rd0\geqslant r_{1}>r_{2}>\cdots>r_{d}. Then equation 9 evaluated at one of these roots yields

fd+1(ri)=qd(ri)fd1(ri),f_{d+1}(r_{i})=-q_{d}(r_{i})\,f_{d-1}(r_{i}),

which implies that fd+1(ri)f_{d+1}(r_{i}) and fd1(ri)f_{d-1}(r_{i}) have different signs. Since fd1(t)f_{d-1}(t) strictly interlaces fd(t)f_{d}(t), its values at r1,r2,,rdr_{1},r_{2},\ldots,r_{d} must alternate in sign, leading to the following table. The entries indicate the signs of fd1(t)f_{d-1}(t) and fd+1(t)f_{d+1}(t), evaluated at r1,r2,,rdr_{1},r_{2},\ldots,r_{d} and in the limit t±t\to\pm\infty.

\infty r1r_{1} r2r_{2} r3r_{3} \cdots rdr_{d} -\infty
fd1(t)f_{d-1}(t) ++ ++ - ++ \cdots ()d1(-)^{d-1} ()d1(-)^{d-1}
fd+1(t)f_{d+1}(t) ++ - ++ - \cdots ()d(-)^{d} ()d+1(-)^{d+1}

The intermediate value theorem implies that fd+1(t)f_{d+1}(t) has d+1d+1 real roots and that fd(t)f_{d}(t) strictly interlaces fd+1(t)f_{d+1}(t). The result then follows by induction on dd. ∎

Proposition 3.17.

Conjectures 3.13 and 3.14 hold for (g,n)=(0,1)(g,n)=(0,1) and (g,n)=(1,1)(g,n)=(1,1).

Proof.

Setting g=0g=0 in the one-point recursion of Theorem 3.12 yields

d2H0,1t(d)=(d1)(2d3)(t+1)H0,1t(d1)(d2)(d3)(t1)2H0,1t(d2).d^{2}\vec{H}^{t}_{0,1}(d)=(d-1)(2d-3)(t+1)\,\vec{H}^{t}_{0,1}(d-1)-(d-2)(d-3)(t-1)^{2}\,\vec{H}^{t}_{0,1}(d-2). (10)

Divide both sides by d2td^{2}t to obtain a recursion governing the polynomials H0,1t(1)t,H0,1t(2)t,H0,1t(3)t,\frac{\vec{H}^{t}_{0,1}(1)}{t},\frac{\vec{H}^{t}_{0,1}(2)}{t},\frac{\vec{H}^{t}_{0,1}(3)}{t},\ldots of the form of equation 9. It follows from Lemma 3.16 that this sequence is real-rooted and strictly interlacing. Therefore, the sequence H0,1t(1),H0,1t(2),H0,1t(3),\vec{H}^{t}_{0,1}(1),\vec{H}^{t}_{0,1}(2),\vec{H}^{t}_{0,1}(3),\ldots is a sequence of real-rooted polynomials in which each polynomial interlaces the next.

For the genus 1 case, we argue in exactly the same way, using the as yet unproven claim that

d(d2)H1,1t(d)=(d1)(2d1)(t+1)H1,1t(d1)(d2)(d+1)(t1)2H1,1t(d2).d(d-2)\,\vec{H}^{t}_{1,1}(d)=(d-1)(2d-1)(t+1)\,\vec{H}^{t}_{1,1}(d-1)-(d-2)(d+1)(t-1)^{2}\,\vec{H}^{t}_{1,1}(d-2). (11)

It remains to prove this relation, which we do using a generating function approach. Multiply both sides by xd1x^{d-1} and sum over all positive integers dd. Setting w1,1(x)=d=1dH1,1t(d)xd1w_{1,1}(x)=\sum_{d=1}^{\infty}d\,\vec{H}^{t}_{1,1}(d)\,x^{d-1}, the claim is equivalent to

x[(t1)2x22(t+1)x+1]xw1,1(x)=[4(t1)2x23(t+1)x1]w1,1(x).-x\left[(t-1)^{2}x^{2}-2(t+1)x+1\right]\frac{\partial}{\partial x}w_{1,1}(x)=\left[4(t-1)^{2}x^{2}-3(t+1)x-1\right]w_{1,1}(x). (12)

We borrow Theorem 4.1 from the next section, which allows us to explicitly compute via w1,1(x)=ω1,1(z)dxw_{1,1}(x)=\frac{\omega_{1,1}(z)}{\mathrm{d}x} that

w1,1(x)=tz(z1)(1z+tz)4(tz2z2+2z1)5,w_{1,1}(x)=-\frac{tz(z-1)(1-z+tz)^{4}}{(tz^{2}-z^{2}+2z-1)^{5}}, (13)

where the coordinates xx and zz are related by x=z(1z)1z+tzx=\frac{z(1-z)}{1-z+tz}. One can now check that the expression for w1,1(x)w_{1,1}(x) of equation 13 satisfies the differential equation of equation 12 using a computer algebra system, thereby proving equation 11. ∎

Remark 3.18.

It is natural to seek higher genus analogues of equations 10 and 11, in order to extend the result and proof of Proposition 3.17. However, one can prove that there exists no recursion of the form

dA(d)H2,1t(d)=(d1)B(d)f(t)H2,1t(d1)(d2)C(d)g(t)H2,1t(d2),dA(d)\,\vec{H}^{t}_{2,1}(d)=(d-1)B(d)f(t)\,\vec{H}^{t}_{2,1}(d-1)-(d-2)C(d)g(t)\,\vec{H}^{t}_{2,1}(d-2),

where A(d),B(d),C(d)A(d),B(d),C(d) are affine functions of dd, f(t)f(t) is an affine function of tt, and g(t)g(t) is a quadratic function of tt. So the exact argument used in the proof of Proposition 3.17 cannot extend to genus 2 and higher without some alteration.

4 Topological recursion

4.1 Topological recursion for deformed monotone Hurwitz numbers

The topological recursion arose in the mathematical physics literature as a formalism to capture loop equations in matrix models [11, 25]. There is now an extensive theory around topological recursion and it is known to govern a wide range of enumerative-geometric problems beyond the original matrix model context. These include: Hurwitz numbers and various generalisations [6, 4, 19, 27, 2, 23], monotone Hurwitz numbers [18], lattice points in moduli spaces of curves [42, 10], intersection theory on moduli spaces of curves [25, 24], Gromov–Witten theory of 1\mathbb{CP}^{1} [43, 22], Gromov–Witten theory of toric Calabi–Yau threefolds [5, 26, 29], and cohomological field theories [22]. The topological recursion is also conjectured to govern certain quantum knot invariants, such as the large NN asymptotics of coloured Jones polynomials [17, 3] and coloured HOMFLY-PT polynomials [35].

In its original formulation due to Chekhov, Eynard and Orantin [11, 25], the topological recursion takes as input a spectral curve (𝒞,x,y,ω0,2)(\mathcal{C},x,y,\omega_{0,2}) comprising a compact Riemann surface 𝒞\mathcal{C} equipped with two meromorphic functions x,y:𝒞1x,y:\mathcal{C}\to\mathbb{CP}^{1} and a bidifferential ω0,2\omega_{0,2} with a double pole along the diagonal. These are required to satisfy mild technical assumptions, which we do not mention here. Indeed, rather than fully define the topological recursion, we refer the reader to the many existing expositions in the literature [18, 28]. For the present discussion, it suffices to note that the topological recursion uses the initial data to define the base cases ω0,1(z1)=y(z1)dx(z1)\omega_{0,1}(z_{1})=y(z_{1})\,\mathrm{d}x(z_{1}) and ω0,2(z1,z2)\omega_{0,2}(z_{1},z_{2}), and then produces so-called correlation differentials via the following recursive formula.333The reader should note that the various appearances of the topological recursion formula in the literature differ subtly, particularly in terms of the expression for ω0,1\omega_{0,1}, the definition of the recursion kernel K(z1,z)K(z_{1},z), and the choice of sign for yy. Ultimately, the first two differences are inconsequential and a change of sign for yy simply sends each correlation differential ωg,n\omega_{g,n} to (1)nωg,n(-1)^{n}\omega_{g,n}.

ωg,n(z1,,zn)=αResz=αK(z1,z)[\displaystyle\omega_{g,n}(z_{1},\ldots,z_{n})=\sum_{\alpha}\mathop{\mathrm{Res}}_{z=\alpha}K(z_{1},z)\Bigg{[} ωg1,n+1(z,σα(z),z2,,zn)\displaystyle\omega_{g-1,n+1}(z,\sigma_{\alpha}(z),z_{2},\ldots,z_{n})
+g1+g2=gI1I2={2,,n}ωg1,|I1|+1(z,zI1)ωg2,|I2|+1(σα(z),zI2)]\displaystyle+\sum_{\begin{subarray}{c}g_{1}+g_{2}=g\\ I_{1}\sqcup I_{2}=\{2,\ldots,n\}\end{subarray}}^{\circ}\omega_{g_{1},|I_{1}|+1}(z,z_{I_{1}})\,\omega_{g_{2},|I_{2}|+1}(\sigma_{\alpha}(z),z_{I_{2}})\Bigg{]}

In various settings, the correlation differential ωg,n\omega_{g,n} acts as a generating function for enumerative-geometric quantities, where gg represents the genus of a surface and nn its number of punctures, or boundaries.

It was previously shown that the monotone Hurwitz numbers are governed by the topological recursion in the following sense [18]. Topological recursion on the spectral curve444The topological recursion is not sensitive to reparametrisation of the underlying plane curve, whose global description in this case is xy2y+1=0xy^{2}-y+1=0. We have expressed the spectral curve here using a different rational parametrisation to that appearing in [18], in order to align more closely with the statement and proof of Theorem 4.1.

𝒞=1,x(z)=z(1z),y(z)=11z,ω0,2(z1,z2)=dz1dz2(z1z2)2\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=z(1-z),\quad y(z)=\frac{1}{1-z},\quad\omega_{0,2}(z_{1},z_{2})=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}

produces correlation differentials satisfying

ωg,n(z1,,zn)=d1dnμ1,,μn=1Hg,n(μ1,,μn)x(z1)μ1x(zn)μn+δg,0δn,2dx(z1)dx(z2)(x(z1)x(z2))2.\omega_{g,n}(z_{1},\ldots,z_{n})=\mathrm{d}_{1}\cdots\mathrm{d}_{n}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}\vec{H}_{g,n}(\mu_{1},\ldots,\mu_{n})\,x(z_{1})^{\mu_{1}}\cdots x(z_{n})^{\mu_{n}}+\delta_{g,0}\delta_{n,2}\,\frac{\mathrm{d}x(z_{1})\,\mathrm{d}x(z_{2})}{\left(x(z_{1})-x(z_{2})\right)^{2}}.

Here, di\mathrm{d}_{i} represents the exterior derivative in the iith coordinate and Hg,n(μ1,,μn)=[Hg,nt(μ1,,μn)]t=1\vec{H}_{g,n}(\mu_{1},\ldots,\mu_{n})=\big{[}\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\big{]}_{t=1} denotes a monotone Hurwitz number.

It is thus natural to consider whether the deformed monotone Hurwitz numbers satisfy the topological recursion on a deformation of the spectral curve above. Perhaps unsurprisingly, this is indeed the case and follows from the representation-theoretic interpretation for deformed monotone Hurwitz numbers of Corollary 2.15 and a powerful result of Bychkov, Dunin-Barkowski, Kazarian and Shadrin [8], which builds on previous work of Alexandrov, Chapuy, Eynard and Harnad [1].

Theorem 4.1.

Topological recursion on the spectral curve

𝒞=1,x(z)=z(1z)1z+tz,y(z)=1z+tz1z,ω0,2(z1,z2)=dz1dz2(z1z2)2\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=\frac{z(1-z)}{1-z+tz},\quad y(z)=\frac{1-z+tz}{1-z},\quad\omega_{0,2}(z_{1},z_{2})=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}

produces correlation differentials satisfying

ωg,n(z1,,zn)=d1dnμ1,,μn=1Hg,nt(μ1,,μn)x(z1)μ1x(zn)μn+δg,0δn,2dx(z1)dx(z2)(x(z1)x(z2))2.\omega_{g,n}(z_{1},\ldots,z_{n})=\mathrm{d}_{1}\cdots\mathrm{d}_{n}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}\vec{H}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\,x(z_{1})^{\mu_{1}}\cdots x(z_{n})^{\mu_{n}}+\delta_{g,0}\delta_{n,2}\,\frac{\mathrm{d}x(z_{1})\,\mathrm{d}x(z_{2})}{\left(x(z_{1})-x(z_{2})\right)^{2}}.
Proof.

The main theorem of Bychkov, Dunin-Barkowski, Kazarian and Shadrin in [8] states that the topological recursion governs the coefficients of certain KP tau functions of hypergeometric type. We present here a simplified version of their result that is fit for purpose.

Let y~(z)=i=1yizi\tilde{y}(z)=\sum_{i=1}^{\infty}y_{i}\,z^{i} be the series expansion of a rational function satisfying y~(0)=0\tilde{y}(0)=0 and let f(z)f(z) be a rational function satisfying f(0)=1f(0)=1. From this data, define the generating function

Z(p1,p2,;)=λ𝒫sλ(p1,p2,)sλ(y1,y2,)λf(c()),Z(p_{1},p_{2},\ldots;\hbar)=\sum_{\lambda\in\mathcal{P}}s_{\lambda}(p_{1},p_{2},\ldots)\,s_{\lambda}\Big{(}\frac{y_{1}}{\hbar},\frac{y_{2}}{\hbar},\ldots\Big{)}\prod_{\square\in\lambda}f(\hbar\,c(\square)),

where 𝒫\mathcal{P} is the set of partitions, sλs_{\lambda} represents the Schur function expressed in terms of power sum symmetric functions, and c()c(\square) denotes the content of the box \square in the Young diagram of a partition. This is a KP tau function of hypergeometric type and there exist “weighted Hurwitz numbers” Xg,n(μ1,,μn)X_{g,n}(\mu_{1},\ldots,\mu_{n}) for g0g\geqslant 0, n1n\geqslant 1 and μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1 such that

Z(p1,p2,;)=exp(g=0n=12g2+nn!μ1,,μn=1Xg,n(μ1,,μn)pμ1pμn).Z(p_{1},p_{2},\ldots;\hbar)=\exp\bigg{(}\sum_{g=0}^{\infty}\sum_{n=1}^{\infty}\frac{\hbar^{2g-2+n}}{n!}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}X_{g,n}(\mu_{1},\ldots,\mu_{n})\,p_{\mu_{1}}\cdots p_{\mu_{n}}\bigg{)}. (14)

Bychkov, Dunin-Barkowski, Kazarian and Shadrin [8] prove that topological recursion on the spectral curve

𝒞=1,x(z)=zf(y~(z)),y(z)=y~(z)x(z),ω0,2(z1,z2)=dz1dz2(z1z2)2\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=\frac{z}{f(\tilde{y}(z))},\quad y(z)=\frac{\tilde{y}(z)}{x(z)},\quad\omega_{0,2}(z_{1},z_{2})=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}

produces correlation differentials satisfying

ωg,n(z1,,zn)=d1dnμ1,,μn=1Xg,n(μ1,,μn)x(z1)μ1x(zn)μn+δg,0δn,2dx(z1)dx(z2)(x(z1)x(z2))2.\omega_{g,n}(z_{1},\ldots,z_{n})=\mathrm{d}_{1}\cdots\mathrm{d}_{n}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}X_{g,n}(\mu_{1},\ldots,\mu_{n})\,x(z_{1})^{\mu_{1}}\cdots x(z_{n})^{\mu_{n}}+\delta_{g,0}\delta_{n,2}\,\frac{\mathrm{d}x(z_{1})\,\mathrm{d}x(z_{2})}{\left(x(z_{1})-x(z_{2})\right)^{2}}.

We simply specialise this result to y~(z)=z\tilde{y}(z)=z and f(z)=1z+tz1zf(z)=\frac{1-z+tz}{1-z}. It remains to check that the monotone deformed Hurwitz numbers agree with the weighted Hurwitz numbers with this particular choice of data.

The exponential of equation 14 transforms the connected generating function to the disconnected generating function, so it suffices to show that the disconnected deformed monotone Hurwitz numbers satisfy

Wg,nt(μ1,,μn)=|Aut(μ)|[2g2+npμ1pμn]Z(p1,p2,;).\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})=|\mathrm{Aut}(\mu)|\,\big{[}\hbar^{2g-2+n}p_{\mu_{1}}\cdots p_{\mu_{n}}\big{]}Z(p_{1},p_{2},\ldots;\hbar).

Here, Aut(μ)\mathrm{Aut}(\mu) denotes the subgroup of permutations in SnS_{n} that fix (μ1,,μn)(\mu_{1},\ldots,\mu_{n}). This automorphism factor arises because the summation in equation 14 is over all tuples of positive integers, rather than partitions.

Now use sλ(p1,p2,)=μ|λ|χμλ|Aut(μ)|pμiμis_{\lambda}(p_{1},p_{2},\ldots)=\displaystyle\sum_{\mu\vdash|\lambda|}\frac{\chi^{\lambda}_{\mu}}{|\mathrm{Aut}(\mu)|}\prod\frac{p_{\mu_{i}}}{\mu_{i}} in the expression

Z(p1,p2,;)=λ𝒫sλ(p1,p2,)sλ(1,0,0,)λ1c()+tc()1c().Z(p_{1},p_{2},\ldots;\hbar)=\sum_{\lambda\in\mathcal{P}}s_{\lambda}(p_{1},p_{2},\ldots)\,s_{\lambda}(\tfrac{1}{\hbar},0,0,\ldots)\prod_{\square\in\lambda}\frac{1-\hbar\,c(\square)+t\hbar\,c(\square)}{1-\hbar\,c(\square)}.

to obtain

|Aut(μ)|[2g2+npμ1pμn]Z(p1,p2,;)=1μ1μn[|μ|+2g2+n]λ|μ|χ111λχμλ|μ|!λ1c()+tc()1c().|\mathrm{Aut}(\mu)|\,\big{[}\hbar^{2g-2+n}p_{\mu_{1}}\cdots p_{\mu_{n}}\big{]}Z(p_{1},p_{2},\ldots;\hbar)\\ =\frac{1}{\mu_{1}\cdots\mu_{n}}\,\big{[}\hbar^{|\mu|+2g-2+n}\big{]}\sum_{\lambda\vdash|\mu|}\frac{\chi^{\lambda}_{11\cdots 1}\,\chi^{\lambda}_{\mu}}{|\mu|!}\prod_{\square\in\lambda}\frac{1-\hbar\,c(\square)+t\hbar\,c(\square)}{1-\hbar\,c(\square)}.

That this is equal to Wg,nt(μ1,,μn)\vec{W}^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) is precisely the content of Proposition 3.3, and this concludes the proof. ∎

Remark 4.2.

The meromorphic functions x,y:11x,y:\mathbb{CP}^{1}\to\mathbb{CP}^{1} of Theorem 4.1 satisfy

xy2+(t1)xyy+1=0,xy^{2}+(t-1)xy-y+1=0,

which is the global form of the spectral curve. The general theory of topological recursion asserts that, for (g,n)(0,1)(g,n)\neq(0,1) or (0,2)(0,2), the correlation differential ωg,n\omega_{g,n} is a rational multidifferential on this curve with poles only at the zeroes of dx\mathrm{d}x and further conditions on the pole structure [25]. This in turn leads to a polynomiality structure theorem for the deformed monotone Hurwitz numbers. Furthermore, the relation between topological recursion and cohomological field theories should lead to an interpretation of deformed monotone Hurwitz numbers as intersection numbers on moduli spaces of curves [24, 22]. However, we do not pursue this investigation further in the present work.

4.2 Topologising sequences of polynomials

From Catalan curves to Narayana curves

As previously mentioned in equation 1, the (g,n)=(0,1)(g,n)=(0,1) case of the deformed monotone Hurwitz numbers recovers the Narayana polynomials in the following way.

(μ+1)H0,1t(μ+1)=Narμ(t):=i=1μ1μ(μi)(μi1)ti(\mu+1)\,\vec{H}^{t}_{0,1}(\mu+1)=\mathrm{Nar}_{\mu}(t):=\sum_{i=1}^{\mu}\frac{1}{\mu}\binom{\mu}{i}\binom{\mu}{i-1}\,t^{i}

Hence, we consider the deformed monotone Hurwitz numbers to be a “topological generalisation” of the Narayana polynomials. This viewpoint appears throughout the literature, such as in Dumitrescu and Mulase’s exposition on generalised Catalan numbers [21].

We propose that the topological recursion can be used as a mechanism to “topologise” sequences of polynomials. One would apply topological recursion to a spectral curve with a deformation parameter tt to obtain a family of polynomials Xg,nt(μ1,,μn)X_{g,n}^{t}(\mu_{1},\ldots,\mu_{n}) for g0g\geqslant 0, n1n\geqslant 1 and μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1 such that X0,1t(1),X0,1t(2),X^{t}_{0,1}(1),X^{t}_{0,1}(2),\ldots recovers the original sequence of polynomials in tt. Furthermore, we claim that interesting properties of the original sequence of polynomials can persist into the topological generalisation. Examples of such properties are the symmetry and unimodality of coefficients as well as the interlacing of roots. These both hold for Narayana polynomials and are respectively proven (Proposition 3.9) and conjectured (Conjecture 3.14) to hold for deformed monotone Hurwitz numbers more generally.

There is more than one way to topologise a given sequence of polynomials. In order to obtain a topological generalisation of the Narayana numbers, it is natural to consider spectral curves that store Catalan numbers in the correlation differential ω0,1\omega_{0,1} and to consider a suitable tt-deformation. The literature suggests three natural candidates for such “Catalan spectral curves” and these curves govern monotone Hurwitz numbers, map enumeration, and dessin d’enfant enumeration. This leads to the following three “Narayana spectral curves” with 𝒞=1\mathcal{C}=\mathbb{CP}^{1}, ω0,2=dz1dz2(z1z2)2\omega_{0,2}=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}, and the meromorphic functions x,y:𝒞1x,y:\mathcal{C}\to\mathbb{CP}^{1} satisfying the following.

  • Monotone Hurwitz numbers. We have

    y(x)=μ=0Catμxμxy2y+1=0,y(x)=\sum_{\mu=0}^{\infty}\mathrm{Cat}_{\mu}\,x^{\mu}\quad\Rightarrow\quad xy^{2}-y+1=0,

    which is the global form of the spectral curve for monotone Hurwitz numbers [18]. Promoting the Catalan numbers to the Narayana polynomials, one obtains

    y(x)=μ=0Narμ(t)xμxy2+(t1)xyy+1=0.y(x)=\sum_{\mu=0}^{\infty}\mathrm{Nar}_{\mu}(t)\,x^{\mu}\quad\Rightarrow\quad xy^{2}+(t-1)xy-y+1=0.

    This is the global form of the spectral curve for deformed monotone Hurwitz numbers, which appeared above in Theorem 4.1.

  • Map enumeration. We have

    y(x)=μ=0Catμx2μ1y2xy+1=0,y(x)=\sum_{\mu=0}^{\infty}\mathrm{Cat}_{\mu}\,x^{-2\mu-1}\quad\Rightarrow\quad y^{2}-xy+1=0,

    which is the global form of the spectral curve for the enumeration of maps [11, 25]. Promoting the Catalan numbers to the Narayana polynomials, one obtains

    y(x)=μ=0Narμ(t)x2μ1xy2x2y+(t1)y+x=0.y(x)=\sum_{\mu=0}^{\infty}\mathrm{Nar}_{\mu}(t)\,x^{-2\mu-1}\quad\Rightarrow\quad xy^{2}-x^{2}y+(t-1)y+x=0.

    To the best of our knowledge, this is the global form of a spectral curve that has not yet been studied in the literature. We do not investigate it further in the present work, largely due to the fact that it has genus 1 for generic values of tt. The topological recursion on spectral curves of positive genus is much less straightforward than on those of genus 0. Nevertheless, it would be interesting to understand this spectral curve and whether it governs a natural enumerative problem.

  • Dessin d’enfant enumeration. We have

    y(x)=μ=0Catμxμ1xy2xy+1=0,y(x)=\sum_{\mu=0}^{\infty}\mathrm{Cat}_{\mu}\,x^{-\mu-1}\quad\Rightarrow\quad xy^{2}-xy+1=0,

    which is the global form of the spectral curve for the enumeration of dessins d’enfant [20, 37]. Promoting the Catalan numbers to the Narayana polynomials, one obtains

    y(x)=μ=0Narμ(t)xμ1xy2xy+(t1)y+1=0.y(x)=\sum_{\mu=0}^{\infty}\mathrm{Nar}_{\mu}(t)\,x^{-\mu-1}\quad\Rightarrow\quad xy^{2}-xy+(t-1)y+1=0.

    This is the global form of a spectral curve with genus 0. It leads to a topological generalisation of the Narayana polynomials that differs from the deformed monotone Hurwitz numbers. We will consider its properties in the next section.

Remark 4.3.

We certainly do not claim that the spectral curves above provide the only natural topological generalisations of the Catalan numbers or the Narayana polynomials. Indeed, one could study spectral curves arising from y(x)=μ=0Catμxaμ+by(x)=\sum_{\mu=0}^{\infty}\mathrm{Cat}_{\mu}\,x^{a\mu+b} or y(x)=μ=0Narμ(t)xaμ+by(x)=\sum_{\mu=0}^{\infty}\mathrm{Nar}_{\mu}(t)\,x^{a\mu+b} for judicious choices of aa and bb, and it is not unlikely that these would lead to interesting enumerative problems.

Deforming the dessin d’enfant enumeration

The previous discussion motivates the study of the spectral curve whose global form is xy2xy+(t1)y+1=0xy^{2}-xy+(t-1)y+1=0. In parametrised form, this corresponds to the spectral curve

𝒞=1,x(z)=1z+tzz(1z),y(z)=z,ω0,2(z1,z2)=dz1dz2(z1z2)2.\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=\frac{1-z+tz}{z(1-z)},\quad y(z)=z,\quad\omega_{0,2}(z_{1},z_{2})=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}.

By construction, this spectral curve should govern a tt-deformation of the usual dessin d’enfant enumeration. In the following, we prove that this enumeration arises by attaching a multiplicative weight tt to each black vertex of a dessin d’enfant. Moreover, we observe that the polynomials arising from this construction empirically satisfy real-rootedness and interlacing properties analogous to those observed for deformed monotone Hurwitz numbers in Conjectures 3.13 and 3.14. Although the weighted enumeration of dessins d’enfant has been studied previously [37], these real-rootedness and interlacing properties have not been observed in the literature, to the best of our knowledge. Our discussion of the weighted enumeration of dessins d’enfant should be considered as a further case study promoting the viewpoint that topological recursion produces interesting topological generalisations of sequences of polynomials.

First, let us define dessins d’enfant — in other words, bicoloured maps — and their enumeration.

Definition 4.4.

A map is a finite graph — possibly with loops or multiple edges — embedded in a compact oriented surface such that the complement of the graph is a disjoint union of topological disks. We refer to these disks as faces and require that they are labelled 1,2,3,,n1,2,3,\ldots,n, where nn denotes the number of faces.

A dessin d’enfant is a map whose vertices have been coloured black or white such that each edge is incident to one black vertex and one white vertex. The degree of a face is defined to be half the number of edges incident to it.

An equivalence between two maps (or dessins d’enfant) is a bijection between their respective vertices, edges and faces that is realised by an orientation-preserving homeomorphism of their underlying surfaces and preserves all adjacencies, incidences, labels (and colours). An automorphism of a map (or dessin d’enfant) is an equivalence from the map (or dessin d’enfant) to itself.

Definition 4.5.

For g0g\geqslant 0, n1n\geqslant 1 and μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1, let Dg,nt(μ1,,μn)[t]D^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\in\mathbb{Q}[t] denote the weighted enumeration of connected genus gg dessins d’enfant with nn labelled faces of degrees μ1,,μn\mu_{1},\ldots,\mu_{n}. The weight attached to a dessin d’enfant Γ\Gamma is tb(Γ)|Aut(Γ)|\frac{t^{b(\Gamma)}}{|\mathrm{Aut}(\Gamma)|}, where b(Γ)b(\Gamma) denotes the number of black vertices of Γ\Gamma and Aut(Γ)\mathrm{Aut}(\Gamma) denotes the automorphism group of Γ\Gamma. Let Dg,nt(μ1,,μn)[t]D^{t\bullet}_{g,n}(\mu_{1},\ldots,\mu_{n})\in\mathbb{Q}[t] denote the analogous count, including possibly disconnected dessins d’enfant.

Example 4.6.

Consider the dessin d’enfant enumeration D0,2t(2,2)D^{t}_{0,2}(2,2). The only dessins d’enfant that contribute are the five pictured below. We have represented these as plane graphs, with the face labelled 1 corresponding to the bounded region and the face labelled 2 corresponding to the unbounded region.

The central dessin d’enfant has two automorphisms, while the remaining dessins d’enfant have one, so we have D0,2t(2,2)=(t31)+(t21+t22+t21)+(t11)=t3+52t2+tD^{t}_{0,2}(2,2)=\big{(}\frac{t^{3}}{1}\big{)}+\big{(}\frac{t^{2}}{1}+\frac{t^{2}}{2}+\frac{t^{2}}{1}\big{)}+\big{(}\frac{t^{1}}{1}\big{)}=t^{3}+\frac{5}{2}t^{2}+t.

Proposition 4.7.

If |μ|<2g+n|\mu|<2g+n, then Dg,nt(μ1,,μn)=0D_{g,n}^{t}(\mu_{1},\ldots,\mu_{n})=0. If |μ|2g+n|\mu|\geqslant 2g+n, then Dg,nt(μ1,,μn)[t]D_{g,n}^{t}(\mu_{1},\ldots,\mu_{n})\in\mathbb{Q}[t] is a polynomial of degree |μ|+12gn|\mu|+1-2g-n whose coefficients are symmetric.

Proof.

Consider a dessin d’enfant with genus gg and nn faces with degrees μ1,,μn\mu_{1},\ldots,\mu_{n}. By an Euler characteristic calculation, the number of vertices is |μ|+22gn|\mu|+2-2g-n. Since there must be at least one black vertex and at least one white vertex, we must have have |μ|2g+n|\mu|\geqslant 2g+n.

We will show that, under the assumption |μ|2g+n|\mu|\geqslant 2g+n, there exists a dessin d’enfant with exactly one white vertex. Take a polygon with 4g+24g+2 sides, whose vertices are alternately coloured black and white. By identifying opposite edges, one obtains a dessin d’enfant on a genus gg surface, with one black vertex, one white vertex, and one face with degree 2g+12g+1. By adding n1n-1 appropriate edges from the black vertex to the white vertex, one can obtain a genus gg dessin d’enfant with one black vertex, one white vertex, and nn faces with any degrees μ1,,μn\mu_{1},\ldots,\mu_{n} satisfying |μ|=2g+n|\mu|=2g+n. We can relax this condition to |μ|2g+n|\mu|\geqslant 2g+n by adding appropriate black vertices with degree 1 that are adjacent to the unique white vertex. Such a dessin d’enfant contributes to degree |μ|+12gn|\mu|+1-2g-n in Dg,nt(μ1,,μn)D_{g,n}^{t}(\mu_{1},\ldots,\mu_{n}), and there can be no contributions in higher degree.

Finally, observe that switching the colours of the vertices of a dessin d’enfant changes the number of black vertices from bb to (|μ|+22gn)b(|\mu|+2-2g-n)-b, leading to the desired symmetry in the coefficients of Dg,nt(μ1,,μn)D_{g,n}^{t}(\mu_{1},\ldots,\mu_{n}). ∎

There is an analogue of the cut-and-join recursion for deformed monotone Hurwitz numbers of Theorem 3.7 in the context of the dessin d’enfant enumeration. We omit the proof, since it can be found in the literature [37].

Proposition 4.8 (Cut-and-join recursion).

Apart from the initial condition D0,1t(1)=1D^{t}_{0,1}(1)=1, the dessin d’enfant enumeration satisfies

μ1Dg,nt(μ1,μS)\displaystyle\mu_{1}D^{t}_{g,n}(\mu_{1},\mu_{S}) =i=2n(μ1+μi1)Dg,n1t(μ1+μi1,μS{i})+(t+1)(μ11)Dg,nt(μ11,μS)\displaystyle=\sum_{i=2}^{n}(\mu_{1}+\mu_{i}-1)\,D^{t}_{g,n-1}(\mu_{1}+\mu_{i}-1,\mu_{S\setminus\{i\}})+(t+1)(\mu_{1}-1)\,D^{t}_{g,n}(\mu_{1}-1,\mu_{S})
+α+β=μ11αβ[Dg1,n+1t(α,β,μS)+g1+g2=gI1I2=SDg1,|I1|+1t(α,μI1)Dg2,|I2|+1t(β,μI2)],\displaystyle+\sum_{\alpha+\beta=\mu_{1}-1}\alpha\beta\Bigg{[}D^{t}_{g-1,n+1}(\alpha,\beta,\mu_{S})+\sum_{\begin{subarray}{c}g_{1}+g_{2}=g\\ I_{1}\sqcup I_{2}=S\end{subarray}}D^{t}_{g_{1},|I_{1}|+1}(\alpha,\mu_{I_{1}})\,D^{t}_{g_{2},|I_{2}|+1}(\beta,\mu_{I_{2}})\Bigg{]},

where we use the notation S={2,3,,n}S=\{2,3,\ldots,n\} and μI={μi1,μi2,,μik}\mu_{I}=\{\mu_{i_{1}},\mu_{i_{2}},\ldots,\mu_{i_{k}}\} for I={i1,i2,,ik}I=\{i_{1},i_{2},\ldots,i_{k}\}.

It is well-known that dessins d’enfant correspond to pairs of permutations acting on the edges — one permutation rotates edges around black vertices and the other rotates edges around white vertices. (Equivalent descriptions in the literature often use triples of permutations that compose to give the identity.) This leads to an expression for the disconnected enumeration of dessins d’enfant in terms of characters of the symmetric group, via Frobenius’s formula. For details, we recommend the book of Lando and Zonkin [38]. To incorporate the parameter tt, we observe that its exponent should equal the number of cycles in the permutation that rotates edges around black vertices. As a consequence of Jucys’s results described in part (a) of Proposition 2.13, we obtain the following result, for which we omit the proof.

Proposition 4.9.

The disconnected enumeration of dessins d’enfant is given by the formula

Dg,nt(μ1,,μn)=1μ1μn[2g2+n]λ𝒫χμλsλ(1,1,)λ(t+c()).D_{g,n}^{t\bullet}(\mu_{1},\ldots,\mu_{n})=\frac{1}{\mu_{1}\cdots\mu_{n}}\,\big{[}\hbar^{2g-2+n}\big{]}\sum_{\lambda\in\mathcal{P}}\chi^{\lambda}_{\mu}\,s_{\lambda}(\tfrac{1}{\hbar},\tfrac{1}{\hbar},\ldots)\prod_{\square\in\lambda}\left(t+\hbar\,c(\square)\right).

We are now in a position to prove that topological recursion governs the weighted enumeration of dessins d’enfant.555Topological recursion for a more general weighted enumeration of dessins d’enfant was previously studied by Kazarian and Zograf [37], although they obtain a different form for the spectral curve.

Theorem 4.10.

Topological recursion on the spectral curve

𝒞=1,x(z)=1z+tzz(1z),y(z)=z,ω0,2=dz1dz2(z1z2)2\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=\frac{1-z+tz}{z(1-z)},\quad y(z)=z,\quad\omega_{0,2}=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}

produces correlation differentials satisfying

ωg,n(z1,,zn)=d1dnμ1,,μn=1Dg,nt(μ1,,μn)x(z1)μ1x(zn)μn+δg,0δn,2dx(z1)dx(z2)(x(z1)x(z2))2.\omega_{g,n}(z_{1},\ldots,z_{n})=\mathrm{d}_{1}\cdots\mathrm{d}_{n}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}D^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\,x(z_{1})^{-\mu_{1}}\cdots x(z_{n})^{-\mu_{n}}+\delta_{g,0}\delta_{n,2}\,\frac{\mathrm{d}x(z_{1})\,\mathrm{d}x(z_{2})}{\left(x(z_{1})-x(z_{2})\right)^{2}}.
Proof.

We again invoke the result of Bychkov, Dunin-Barkowski, Kazarian and Shadrin [8], noting that the more restricted result of Alexandrov, Chapuy, Eynard and Harnad [1] would suffice in this particular context. See the proof of Theorem 4.1 above for a statement of the result.

The representation-theoretic interpretation of the dessin d’enfant enumeration given in Proposition 4.9 implies that they are weighted Hurwitz numbers with the choice of data y~(z)=i=1zi=z1z\tilde{y}(z)=\sum_{i=1}^{\infty}z^{i}=\frac{z}{1-z} and f(z)=t+zf(z)=t+z. Hence, topological recursion on the spectral curve

𝒞=1,x(z)=zf(y~(z))=z(1z)ttz+z,y(z)=y~(z)x(z)=ttz+z(1z)2,ω0,2(z1,z2)=dz1dz2(z1z2)2\mathcal{C}=\mathbb{CP}^{1},\quad x(z)=\frac{z}{f(\tilde{y}(z))}=\frac{z(1-z)}{t-tz+z},\quad y(z)=\frac{\tilde{y}(z)}{x(z)}=\frac{t-tz+z}{(1-z)^{2}},\quad\omega_{0,2}(z_{1},z_{2})=\frac{\mathrm{d}z_{1}\,\mathrm{d}z_{2}}{(z_{1}-z_{2})^{2}}

produces correlation differentials satisfying

ωg,n(z1,,zn)=d1dnμ1,,μn=1Dg,nt(μ1,,μn)x(z1)μ1x(zn)μn+δg,0δn,2dx(z1)dx(z2)(x(z1)x(z2))2.\omega_{g,n}(z_{1},\ldots,z_{n})=\mathrm{d}_{1}\cdots\mathrm{d}_{n}\sum_{\mu_{1},\ldots,\mu_{n}=1}^{\infty}D^{t}_{g,n}(\mu_{1},\ldots,\mu_{n})\,x(z_{1})^{\mu_{1}}\cdots x(z_{n})^{\mu_{n}}+\delta_{g,0}\delta_{n,2}\,\frac{\mathrm{d}x(z_{1})\,\mathrm{d}x(z_{2})}{\left(x(z_{1})-x(z_{2})\right)^{2}}.

This does not yet match our spectral curve, since the enumeration is stored as an expansion at x(z)=0x(z)=0 rather than at x(z)=x(z)=\infty. We obtain the desired spectral curve by performing the following three transformations in order:

(x,y,t)(x1,x2y,t),(x,y,t)(x,y+tx,t),(x,y,t)(tx,y,t1).(x,y,t)\mapsto(x^{-1},x^{2}y,t),\qquad(x,y,t)\mapsto(x,y+tx,t),\qquad(x,y,t)(tx,y,t^{-1}).

The first transformation changes the expansion at x(z)=0x(z)=0 to an expansion at x(z)=x(z)=\infty; the second transformation preserves the correlation differentials [28, Section 4.2]; and the third transformation preserves the coefficients of the expansion, due to the symmetry of the coefficients of Dg,nt(μ1,,μn)D^{t}_{g,n}(\mu_{1},\ldots,\mu_{n}) and the homogeneity property of topological recursion [28, Section 4.1]. Thus, we arrive at the desired result. ∎

Although the enumeration of dessins d’enfant has been studied previously [37], the following conjectural properties have not yet been observed in the literature, to the best of our knowlege.

Conjecture 4.11 (Real-rootedness and interlacing).

For all g0g\geqslant 0, n1n\geqslant 1 and μ1,,μn1\mu_{1},\ldots,\mu_{n}\geqslant 1, the dessin d’enfant enumeration Dg,nt(μ1,μ2,,μn)D_{g,n}^{t}(\mu_{1},\mu_{2},\ldots,\mu_{n}) is a real-rooted polynomial in tt. Furthermore, the polynomial Dg,nt(μ1,μ2,,μn)D_{g,n}^{t}(\mu_{1},\mu_{2},\ldots,\mu_{n}) interlaces each of the nn polynomials

Dg,nt(μ1+1,μ2,,μn),Dg,nt(μ1,μ2+1,,μn),,Dg,nt(μ1,μ2,,μn+1).D_{g,n}^{t}(\mu_{1}+1,\mu_{2},\ldots,\mu_{n}),\quad D_{g,n}^{t}(\mu_{1},\mu_{2}+1,\ldots,\mu_{n}),\quad\ldots,\quad D_{g,n}^{t}(\mu_{1},\mu_{2},\ldots,\mu_{n}+1).

As with the deformed monotone Hurwitz numbers, we can effectively calculate Dg,nt(μ1,,μn)D_{g,n}^{t}(\mu_{1},\ldots,\mu_{n}) using the cut-and-join recursion of Proposition 4.8 and explicitly check for real-rootedness and interlacing. Again, one finds a wealth of data to support Conjecture 4.11. We consider this as evidence that the real-rootedness and interlacing observed for deformed monotone Hurwitz numbers is not simply a sporadic artefact, but may be a more widespread phenomenon with a deep reason underlying it.

Remark 4.12.

As previously mentioned, dessins d’enfant correspond to pairs of permutations acting on the edges, or equivalently, triples of permutations that compose to give the identity. It follows from Proposition 2.13 that each permutation has a unique strictly monotone factorisation, defined analogously to a monotone factorisation in Definition 2.10, but with the stronger monotonicity requirement that b1<b2<<brb_{1}<b_{2}<\cdots<b_{r}. Using this result on the permutation that rotates edges around black vertices leads to the fact that the enumeration of dessins d’enfant can be interpreted as strictly monotone Hurwitz numbers.

Appendix A Data

Deformed monotone Hurwitz numbers

The deformed monotone Hurwitz numbers can be computed using the cut-and-join recursion or the topological recursion. These were both implemented in SageMath to produce the following table [48].

(μ1,,μn)(\mu_{1},\ldots,\mu_{n}) μ1μnH0,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,\vec{H}^{t}_{0,n}(\mu_{1},\ldots,\mu_{n}) μ1μnH1,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,\vec{H}^{t}_{1,n}(\mu_{1},\ldots,\mu_{n})
(1)(1) 11 0
(2)(2) tt tt
(3)(3) t2+tt^{2}+t 5t2+5t5t^{2}+5t
(4)(4) t3+3t2+tt^{3}+3t^{2}+t 15t3+40t2+15t15t^{3}+40t^{2}+15t
(5)(5) t4+6t3+6t2+tt^{4}+6t^{3}+6t^{2}+t 35t4+175t3+175t2+35t35t^{4}+175t^{3}+175t^{2}+35t
(6)(6) t5+10t4+20t3+10t2+tt^{5}+10t^{4}+20t^{3}+10t^{2}+t 70t5+560t4+1050t3+560t2+70t70t^{5}+560t^{4}+1050t^{3}+560t^{2}+70t
(1,1)(1,1) tt tt
(2,1)(2,1) 2t2+2t2t^{2}+2t 10t2+10t10t^{2}+10t
(3,1)(3,1) 3t3+9t2+3t3t^{3}+9t^{2}+3t 45t3+120t2+45t45t^{3}+120t^{2}+45t
(2,2)(2,2) 4t3+10t2+4t4t^{3}+10t^{2}+4t 50t3+128t2+50t50t^{3}+128t^{2}+50t
(4,1)(4,1) 4t4+24t3+24t2+4t4t^{4}+24t^{3}+24t^{2}+4t 140t4+700t3+700t2+140t140t^{4}+700t^{3}+700t^{2}+140t
(3,2)(3,2) 6t4+30t3+30t2+6t6t^{4}+30t^{3}+30t^{2}+6t 168t4+792t3+792t2+168t168t^{4}+792t^{3}+792t^{2}+168t
(5,1)(5,1) 5t5+50t4+100t3+50t2+5t5t^{5}+50t^{4}+100t^{3}+50t^{2}+5t 350t5+2800t4+5250t3+2800t2+350t350t^{5}+2800t^{4}+5250t^{3}+2800t^{2}+350t
(4,2)(4,2) 8t5+68t4+128t3+68t2+8t8t^{5}+68t^{4}+128t^{3}+68t^{2}+8t 448t5+3348t4+6128t3+3348t2+448t448t^{5}+3348t^{4}+6128t^{3}+3348t^{2}+448t
(3,3)(3,3) 9t5+72t4+138t3+72t2+9t9t^{5}+72t^{4}+138t^{3}+72t^{2}+9t 462t5+3432t4+6312t3+3432t2+462t462t^{5}+3432t^{4}+6312t^{3}+3432t^{2}+462t
(1,1,1)(1,1,1) 4t2+4t4t^{2}+4t 20t2+20t20t^{2}+20t
(2,1,1)(2,1,1) 10t3+28t2+10t10t^{3}+28t^{2}+10t 140t3+368t2+140t140t^{3}+368t^{2}+140t
(3,1,1)(3,1,1) 18t4+102t3+102t2+18t18t^{4}+102t^{3}+102t^{2}+18t 588t4+2892t3+2892t2+588t588t^{4}+2892t^{3}+2892t^{2}+588t
(2,2,1)(2,2,1) 24t4+120t3+120t2+24t24t^{4}+120t^{3}+120t^{2}+24t 672t4+3168t3+3168t2+672t672t^{4}+3168t^{3}+3168t^{2}+672t
(4,1,1)(4,1,1) 28t5+268t4+528t3+268t2+28t28t^{5}+268t^{4}+528t^{3}+268t^{2}+28t 1848t5+14548t4+27128t3+14548t2+1848t1848t^{5}+14548t^{4}+27128t^{3}+14548t^{2}+1848t
(3,2,1)(3,2,1) 42t5+348t4+660t3+348t2+42t42t^{5}+348t^{4}+660t^{3}+348t^{2}+42t 2268t5+16908t4+31008t3+16908t2+2268t2268t^{5}+16908t^{4}+31008t^{3}+16908t^{2}+2268t
(2,2,2)(2,2,2) 56t5+424t4+768t3+424t2+56t56t^{5}+424t^{4}+768t^{3}+424t^{2}+56t 2688t5+19128t4+34416t3+19128t2+2688t2688t^{5}+19128t^{4}+34416t^{3}+19128t^{2}+2688t
(μ1,,μn)(\mu_{1},\ldots,\mu_{n}) μ1μnH2,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,\vec{H}^{t}_{2,n}(\mu_{1},\ldots,\mu_{n}) μ1μnH3,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,\vec{H}^{t}_{3,n}(\mu_{1},\ldots,\mu_{n})
(1) 0 0
(2) tt tt
(3) 21t2+21t21t^{2}+21t 85t2+85t85t^{2}+85t
(4) 161t3+413t2+161t161t^{3}+413t^{2}+161t 1555t3+3930t2+1555t1555t^{3}+3930t^{2}+1555t
(5) 777t4+3612t3+3612t2+777t777t^{4}+3612t^{3}+3612t^{2}+777t 14575t4+65505t3+65505t2+14575t14575t^{4}+65505t^{3}+65505t^{2}+14575t
(1, 1) tt tt
(2, 1) 42t2+42t42t^{2}+42t 170t2+170t170t^{2}+170t
(3, 1) 483t3+1239t2+483t483t^{3}+1239t^{2}+483t 4665t3+11790t2+4665t4665t^{3}+11790t^{2}+4665t
(2, 2) 504t3+1278t2+504t504t^{3}+1278t^{2}+504t 4750t3+11956t2+4750t4750t^{3}+11956t^{2}+4750t
(4, 1) 3108t4+14448t3+14448t2+3108t3108t^{4}+14448t^{3}+14448t^{2}+3108t 58300t4+262020t3+262020t2+58300t58300t^{4}+262020t^{3}+262020t^{2}+58300t
(3, 2) 3402t4+15450t3+15450t2+3402t3402t^{4}+15450t^{3}+15450t^{2}+3402t 61116t4+271764t3+271764t2+61116t61116t^{4}+271764t^{3}+271764t^{2}+61116t
(1, 1, 1) 84t2+84t84t^{2}+84t 340t2+340t340t^{2}+340t
(2, 1, 1) 1470t3+3756t2+1470t1470t^{3}+3756t^{2}+1470t 14080t3+35536t2+14080t14080t^{3}+35536t^{2}+14080t
(3, 1, 1) 12726t4+58794t3+58794t2+12726t12726t^{4}+58794t^{3}+58794t^{2}+12726t 236016t4+1057824t3+1057824t2+236016t236016t^{4}+1057824t^{3}+1057824t^{2}+236016t
(2, 2, 1) 13608t4+61800t3+61800t2+13608t13608t^{4}+61800t^{3}+61800t^{2}+13608t 244464t4+1087056t3+1087056t2+244464t244464t^{4}+1087056t^{3}+1087056t^{2}+244464t

Dessin d’enfant enumeration

The weighted dessin d’enfant enumeration can be computed using the cut-and-join recursion or the topological recursion. These were both implemented in SageMath to produce the following table [48].

(μ1,,μn)(\mu_{1},\ldots,\mu_{n}) μ1μnD0,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,D_{0,n}^{t}(\mu_{1},\ldots,\mu_{n}) μ1μnD1,nt(μ1,,μn)\mu_{1}\cdots\mu_{n}\,D_{1,n}^{t}(\mu_{1},\ldots,\mu_{n})
(1)(1) tt 0
(2)(2) t2+tt^{2}+t 0
(3)(3) t3+3t2+tt^{3}+3t^{2}+t tt
(4)(4) t4+6t3+6t2+tt^{4}+6t^{3}+6t^{2}+t 5t2+5t5t^{2}+5t
(5)(5) t5+10t4+20t3+10t2+tt^{5}+10t^{4}+20t^{3}+10t^{2}+t 15t3+40t2+15t15t^{3}+40t^{2}+15t
(6)(6) t6+15t5+50t4+50t3+15t2+tt^{6}+15t^{5}+50t^{4}+50t^{3}+15t^{2}+t 35t4+175t3+175t2+35t35t^{4}+175t^{3}+175t^{2}+35t
(1,1)(1,1) tt 0
(2,1)(2,1) 2t2+2t2t^{2}+2t 0
(3,1)(3,1) 3t3+9t2+3t3t^{3}+9t^{2}+3t 3t3t
(2,2)(2,2) 4t3+10t2+4t4t^{3}+10t^{2}+4t 2t2t
(4,1)(4,1) 4t4+24t3+24t2+4t4t^{4}+24t^{3}+24t^{2}+4t 20t2+20t20t^{2}+20t
(3,2)(3,2) 6t4+30t3+30t2+6t6t^{4}+30t^{3}+30t^{2}+6t 18t2+18t18t^{2}+18t
(5,1)(5,1) 5t5+50t4+100t3+50t2+5t5t^{5}+50t^{4}+100t^{3}+50t^{2}+5t 75t3+200t2+75t75t^{3}+200t^{2}+75t
(4,2)(4,2) 8t5+68t4+128t3+68t2+8t8t^{5}+68t^{4}+128t^{3}+68t^{2}+8t 80t3+200t2+80t80t^{3}+200t^{2}+80t
(3,3)(3,3) 9t5+72t4+138t3+72t2+9t9t^{5}+72t^{4}+138t^{3}+72t^{2}+9t 75t3+198t2+75t75t^{3}+198t^{2}+75t
(1,1,1)(1,1,1) 2t2t 0
(2,1,1)(2,1,1) 6t2+6t6t^{2}+6t 0
(3,1,1)(3,1,1) 12t3+36t2+12t12t^{3}+36t^{2}+12t 12t12t
(2,2,1)(2,2,1) 16t3+40t2+16t16t^{3}+40t^{2}+16t 8t8t
(4,1,1)(4,1,1) 20t4+120t3+120t2+20t20t^{4}+120t^{3}+120t^{2}+20t 100t2+100t100t^{2}+100t
(3,2,1)(3,2,1) 30t4+150t3+150t2+30t30t^{4}+150t^{3}+150t^{2}+30t 90t2+90t90t^{2}+90t
(2,2,2)(2,2,2) 40t4+176t3+176t2+40t40t^{4}+176t^{3}+176t^{2}+40t 80t2+80t80t^{2}+80t

Weingarten functions

The value of Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma) can be calculated by inverting the orthogonality relations or by the character formula. The value of Wg𝐔(σ)\operatorname{Wg^{\mathbf{U}}}(\sigma) is the leading coefficient of Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma), considered as a polynomial in MM.

σ\sigma Wg𝐔(σ)\operatorname{Wg^{\mathbf{U}}}(\sigma) Wg𝐒(σ)\operatorname{Wg^{\mathbf{S}}}(\sigma)
()(\,) 11 11
(1)(1) 1N\frac{1}{N} MN\frac{M}{N}
(1)(2)(1)(2) 1N21\frac{1}{N^{2}-1} M(MN1)N(N21)\frac{M(MN-1)}{N(N^{2}-1)}
(12)(12) 1N(N21)\frac{-1}{N(N^{2}-1)} M(MN)N(N21)\frac{-M(M-N)}{N(N^{2}-1)}
(1)(2)(3)(1)(2)(3) N22N(N21)(N24)\frac{N^{2}-2}{N(N^{2}-1)(N^{2}-4)} M(M2N22M23MN+4)N(N21)(N24)\frac{M(M^{2}N^{2}-2M^{2}-3MN+4)}{N(N^{2}-1)(N^{2}-4)}
(12)(3)(12)(3) 1(N21)(N24)\frac{-1}{(N^{2}-1)(N^{2}-4)} M(MN)(MN2)N(N21)(N24)\frac{-M(M-N)(MN-2)}{N(N^{2}-1)(N^{2}-4)}
(123)(123) 2N(N21)(N24)\frac{2}{N(N^{2}-1)(N^{2}-4)} M(MN)(2MN)N(N21)(N24)\frac{M(M-N)(2M-N)}{N(N^{2}-1)(N^{2}-4)}
(1)(2)(3)(4)(1)(2)(3)(4) N48N2+6N2(N21)(N24)(N29)\frac{N^{4}-8N^{2}+6}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)} M(M3N48M3N2+6M36M2N3+24M2N+19MN26M30N)N2(N21)(N24)(N29)\frac{M(M^{3}N^{4}-8M^{3}N^{2}+6M^{3}-6M^{2}N^{3}+24M^{2}N+19MN^{2}-6M-30N)}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)}
(12)(3)(4)(12)(3)(4) 1N(N21)(N29)\frac{-1}{N(N^{2}-1)(N^{2}-9)} M(MN)(M2N24M25MN+10)N(N21)(N24)(N29)\frac{-M(M-N)(M^{2}N^{2}-4M^{2}-5MN+10)}{N(N^{2}-1)(N^{2}-4)(N^{2}-9)}
(12)(34)(12)(34) N2+6N2(N21)(N24)(N29)\frac{N^{2}+6}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)} M(MN)(M2N2+6M2MN36MN+4N26)N2(N21)(N24)(N29)\frac{M(M-N)(M^{2}N^{2}+6M^{2}-MN^{3}-6MN+4N^{2}-6)}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)}
(123)(4)(123)(4) 2N23N2(N21)(N24)(N29)\frac{2N^{2}-3}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)} M(MN)(2M2N23M2MN36MN+3N2+3)N2(N21)(N24)(N29)\frac{M(M-N)(2M^{2}N^{2}-3M^{2}-MN^{3}-6MN+3N^{2}+3)}{N^{2}(N^{2}-1)(N^{2}-4)(N^{2}-9)}
(1234)(1234) 5N(N21)(N24)(N29)\frac{-5}{N(N^{2}-1)(N^{2}-4)(N^{2}-9)} M(MN)(5M25MN+N2+1)N(N21)(N24)(N29)\frac{-M(M-N)(5M^{2}-5MN+N^{2}+1)}{N(N^{2}-1)(N^{2}-4)(N^{2}-9)}

References

  • [1] A. Alexandrov, G. Chapuy, B. Eynard, and J. Harnad. Weighted Hurwitz numbers and topological recursion. Comm. Math. Phys., 375(1):237–305, 2020.
  • [2] Gaëtan Borot, Norman Do, Maksim Karev, Danilo Lewański, and Ellena Moskovsky. Double Hurwitz numbers: polynomiality, topological recursion and intersection theory. Math. Ann., 2022.
  • [3] Gaëtan Borot and Bertrand Eynard. All order asymptotics of hyperbolic knot invariants from non-perturbative topological recursion of A-polynomials. Quantum Topol., 6(1):39–138, 2015.
  • [4] Vincent Bouchard, Daniel Hernández Serrano, Xiaojun Liu, and Motohico Mulase. Mirror symmetry for orbifold Hurwitz numbers. J. Differential Geom., 98(3):375–423, 2014.
  • [5] Vincent Bouchard, Albrecht Klemm, Marcos Mariño, and Sara Pasquetti. Remodeling the B-model. Comm. Math. Phys., 287(1):117–178, 2009.
  • [6] Vincent Bouchard and Marcos Mariño. Hurwitz numbers, matrix models and enumerative geometry. In From Hodge theory to integrability and TQFT tt*-geometry, volume 78 of Proc. Sympos. Pure Math., pages 263–283. Amer. Math. Soc., Providence, RI, 2008.
  • [7] Francesco Brenti. Unimodal polynomials arising from symmetric functions. Proc. Amer. Math. Soc., 108(4):1133–1141, 1990.
  • [8] Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, and Sergey Shadrin. Topological recursion for Kadomtsev–Petviashvili tau functions of hypergeometric type. arXiv:2012.14723 [math-ph], 2021.
  • [9] Anupam Chaudhuri and Norman Do. Generalisations of the Harer-Zagier recursion for 1-point functions. J. Algebraic Combin., 53(2):469–503, 2021.
  • [10] Anupam Chaudhuri, Norman Do, and Ellena Moskovsky. Local topological recursion governs the enumeration of lattice points in ¯g,n\overline{\mathcal{M}}_{g,n}. arXiv:1906.06964 [math.GT], 2019.
  • [11] Leonid Chekhov and Bertrand Eynard. Hermitian matrix model free energy: Feynman graph technique for all genera. J. High Energy Phys., (3):014, 18, 2006.
  • [12] Benoît Collins. Moments and cumulants of polynomial random variables on unitary groups, the Itzykson-Zuber integral, and free probability. Int. Math. Res. Not., (17):953–982, 2003.
  • [13] Benoît Collins and Sho Matsumoto. Weingarten calculus via orthogonality relations: new applications. ALEA Lat. Am. J. Probab. Math. Stat., 14(1):631–656, 2017.
  • [14] Benoît Collins, Sho Matsumoto, and Jonathan Novak. The Weingarten calculus. Notices Amer. Math. Soc., 69(5):734–745, 2022.
  • [15] Benoît Collins and Piotr Śniady. Integration with respect to the Haar measure on unitary, orthogonal and symplectic group. Comm. Math. Phys., 264(3):773–795, 2006.
  • [16] Joe Diestel and Angela Spalsbury. The joys of Haar measure, volume 150 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2014.
  • [17] Robbert Dijkgraaf, Hiroyuki Fuji, and Masahide Manabe. The volume conjecture, perturbative knot invariants, and recursion relations for topological strings. Nuclear Phys. B, 849(1):166–211, 2011.
  • [18] Norman Do, Alastair Dyer, and Daniel V. Mathews. Topological recursion and a quantum curve for monotone Hurwitz numbers. J. Geom. Phys., 120:19–36, 2017.
  • [19] Norman Do, Oliver Leigh, and Paul Norbury. Orbifold Hurwitz numbers and Eynard-Orantin invariants. Math. Res. Lett., 23(5):1281–1327, 2016.
  • [20] Norman Do and Paul Norbury. Topological recursion for irregular spectral curves. J. Lond. Math. Soc. (2), 97(3):398–426, 2018.
  • [21] Olivia Dumitrescu and Motohico Mulase. Lectures on the topological recursion for Higgs bundles and quantum curves. In The geometry, topology and physics of moduli spaces of Higgs bundles, volume 36 of Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap., pages 103–198. World Sci. Publ., Hackensack, NJ, 2018.
  • [22] P. Dunin-Barkowski, N. Orantin, S. Shadrin, and L. Spitz. Identification of the Givental formula with the spectral curve topological recursion procedure. Comm. Math. Phys., 328(2):669–700, 2014.
  • [23] Petr Dunin-Barkowski, Reinier Kramer, Alexandr Popolitov, and Sergey Shadrin. Loop equations and a proof of Zvonkine’s qrqr-ELSV formula. arXiv:1905.04524 [math.AG], 2020.
  • [24] B. Eynard. Invariants of spectral curves and intersection theory of moduli spaces of complex curves. Commun. Number Theory Phys., 8(3):541–588, 2014.
  • [25] B. Eynard and N. Orantin. Invariants of algebraic curves and topological expansion. Commun. Number Theory Phys., 1(2):347–452, 2007.
  • [26] B. Eynard and N. Orantin. Computation of open Gromov-Witten invariants for toric Calabi-Yau 3-folds by topological recursion, a proof of the BKMP conjecture. Comm. Math. Phys., 337(2):483–567, 2015.
  • [27] Bertrand Eynard, Motohico Mulase, and Bradley Safnuk. The Laplace transform of the cut-and-join equation and the Bouchard-Mariño conjecture on Hurwitz numbers. Publ. Res. Inst. Math. Sci., 47(2):629–670, 2011.
  • [28] Bertrand Eynard and Nicolas Orantin. Topological recursion in enumerative geometry and random matrices. J. Phys. A, 42(29):293001, 117, 2009.
  • [29] Bohan Fang, Chiu-Chu Melissa Liu, and Zhengyu Zong. On the remodeling conjecture for toric Calabi-Yau 3-orbifolds. J. Amer. Math. Soc., 33(1):135–222, 2020.
  • [30] Valentin Féray. On complete functions in Jucys-Murphy elements. Ann. Comb., 16(4):677–707, 2012.
  • [31] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833 [math.CA], 2008.
  • [32] I. P. Goulden, Mathieu Guay-Paquet, and Jonathan Novak. Monotone Hurwitz numbers in genus zero. Canad. J. Math., 65(5):1020–1042, 2013.
  • [33] I. P. Goulden, Mathieu Guay-Paquet, and Jonathan Novak. Monotone Hurwitz numbers and the HCIZ integral. Ann. Math. Blaise Pascal, 21(1):71–89, 2014.
  • [34] I. P. Goulden, D. M. Jackson, and A. Vainshtein. The number of ramified coverings of the sphere by the torus and surfaces of higher genera. Ann. Comb., 4(1):27–46, 2000.
  • [35] Jie Gu, Hans Jockers, Albrecht Klemm, and Masoud Soroush. Knot invariants from topological recursion on augmentation varieties. Comm. Math. Phys., 336(2):987–1051, 2015.
  • [36] A.-A. A. Jucys. Symmetric polynomials and the center of the symmetric group ring. Rep. Mathematical Phys., 5(1):107–112, 1974.
  • [37] Maxim Kazarian and Peter Zograf. Virasoro constraints and topological recursion for Grothendieck’s dessin counting. Lett. Math. Phys., 105(8):1057–1084, 2015.
  • [38] Sergei K. Lando and Alexander K. Zvonkin. Graphs on surfaces and their applications, volume 141 of Encyclopaedia of Mathematical Sciences. Springer-Verlag, Berlin, 2004. With an appendix by Don B. Zagier, Low-Dimensional Topology, II.
  • [39] Sho Matsumoto. Weingarten calculus for matrix ensembles associated with compact symmetric spaces. Random Matrices Theory Appl., 2(2):1350001, 26, 2013.
  • [40] Sho Matsumoto and Jonathan Novak. Jucys-Murphy elements and unitary matrix integrals. Int. Math. Res. Not. IMRN, (2):362–397, 2013.
  • [41] G. E. Murphy. A new construction of Young’s seminormal representation of the symmetric groups. J. Algebra, 69(2):287–297, 1981.
  • [42] Paul Norbury. String and dilaton equations for counting lattice points in the moduli space of curves. Trans. Amer. Math. Soc., 365(4):1687–1709, 2013.
  • [43] Paul Norbury and Nick Scott. Gromov-Witten invariants of 1\mathbb{P}^{1} and Eynard-Orantin invariants. Geom. Topol., 18(4):1865–1910, 2014.
  • [44] Jonathan I. Novak. Jucys-Murphy elements and the unitary Weingarten function. In Noncommutative harmonic analysis with applications to probability II, volume 89 of Banach Center Publ., pages 231–235. Polish Acad. Sci. Inst. Math., Warsaw, 2010.
  • [45] Andrei Okounkov and Anatoly Vershik. A new approach to representation theory of symmetric groups. Selecta Math. (N.S.), 2(4):581–605, 1996.
  • [46] Robert A. Sulanke. Counting lattice paths by Narayana polynomials. Electron. J. Combin., 7:Research Paper 40, 9, 2000.
  • [47] Hua Sun, Yi Wang, and Hai Xia Zhang. Polynomials with palindromic and unimodal coefficients. Acta Math. Sin. (Engl. Ser.), 31(4):565–575, 2015.
  • [48] The Sage Developers. SageMath, the Sage Mathematics Software System (Version 9.8), 2023. https://www.sagemath.org.
  • [49] Don Weingarten. Asymptotic behavior of group integrals in the limit of infinite rank. J. Mathematical Phys., 19(5):999–1001, 1978.
  • [50] Doron Zeilberger. A one-line high school algebra proof of the unimodality of the Gaussian polynomials [kn][^{n}_{k}] for k<20k<20. In qq-series and partitions (Minneapolis, MN, 1988), volume 18 of IMA Vol. Math. Appl., pages 67–72. Springer, New York, 1989.