Simple maps, Hurwitz numbers, and Topological Recursion
Ga\"etan Borot, Elba Garcia-Failde

TL;DR
This paper introduces fully simple maps with non self-intersecting boundaries, explores their combinatorics, relates their generating series to ordinary maps, and conjectures their computation via topological recursion, connecting to Hurwitz numbers and matrix models.
Contribution
It defines fully simple maps, establishes their generating series relations, and conjectures their computation through topological recursion, linking combinatorics, matrix models, and Hurwitz numbers.
Findings
Generating series of simple disks is the functional inverse of ordinary disks.
Derived an elegant formula for cylinders in fully simple maps.
Connected fully simple maps to Hurwitz numbers and matrix models.
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 free cumulants established by Collins et al. math.OA/0606431, and implement the symplectic transformation 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 and . We propose an argument to prove this statement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
