Abstract

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple maps with topology of a disk or a cylinder. We show that the generating series of simple disks is given by the functional inversion of the generating series of ordinary disks. We also obtain an elegant formula for cylinders. These relations reproduce the relation between moments and (higher order) free cumulants established by Collins et al. [22], and implement the symplectic transformation x leftrightarrow y on the spectral curve in the context of topological recursion. We conjecture that the generating series of fully simple maps are computed by the topological recursion after exchange of x and y. We propose an argument to prove this statement conditionally to a mild version of the symplectic invariance for the 1-hermitian matrix model, which is believed to be true but has not been proved yet. Our conjecture can be considered as a combinatorial interpretation of the property of symplectic invariance of the topological recursion. Our argument relies on an (unconditional) matrix model interpretation of fully simple maps, via the formal hermitian matrix model with external field. We also deduce a universal relation between generating series of fully simple maps and of ordinary maps, which involves double monotone Hurwitz numbers. In particular, (ordinary) maps without internal faces—which are generated by the Gaussian Unitary Ensemble—and with boundary perimeters (lambda _1,ldots ,lambda _n) are strictly monotone double Hurwitz numbers with ramifications lambda above infty and (2,ldots ,2) above 0. Combining with a recent result of Dubrovin et al. [24], this implies an ELSV-like formula for these Hurwitz numbers.

Highlights

  • Maps are surfaces obtained from gluing polygons, and their enumeration by combinatorial methods has been intensively studied since the pioneering works of Tutte [64]

  • We study in detail the combinatorics of fully simple maps with topology of a disk or a cylinder

  • We proved these formulas via combinatorics of maps, independently of [22], and explained that they are natural in light of the topological recursion

Read more

Summary

Introduction

Maps are surfaces obtained from gluing polygons, and their enumeration by combinatorial methods has been intensively studied since the pioneering works of Tutte [64]. The results of Theorem 1.1 for simple disks and Theorem 1.2 for fully simple cylinders coincide with the formulas found for generating series of the first and second order free cumulants in [22] We proved these formulas via combinatorics of maps, independently of [22], and explained that they are natural in light of the topological recursion. The restriction of Conjecture 1.8 to genus 0 would give a recursive algorithm to compute the higher order free cumulants of the matrix M sampled from the large N limit of the measure (1.1) This is interesting as the relation at the level of generating series between n-th order free cumulants and n-th correlation moments, called R-transform machinery, is not otherwise known for n ≥ 3 as of writing, imposing to work with their involved combinatorial definition via so-called partitioned permutations. Given the universality of the TR structure, one may wonder if a universal theory of approximate higher order free cumulants can be formulated taking into account the higher genus amplitudes

Objects of Study
Simple Disks from Ordinary Disks
Cylinders
Combinatorial Interpretation of Symplectic Invariance
Fully Simple Pairs of Pants
Generalization to Stuffed Maps
Ordinary vs Fully Simple for Unitarily Invariant Random Matrix Models
Hypergeometric tau-functions We consider the Frobenius’ characteristic map
Combinatorial Interpretation in Terms of Ordinary and Fully Simple Maps
10. Towards a Proof of the Conjecture for Usual Maps
11. Relation with Free Probability
12. An ELSV-Like Formula for Monotone Hurwitz Numbers

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.