pith. sign in

arxiv: 1412.1698 · v2 · pith:XRRZI4CBnew · submitted 2014-12-04 · 🧮 math-ph · math.CO· math.MP

Combinatorics of loop equations for branched covers of sphere

classification 🧮 math-ph math.COmath.MP
keywords curvespectralmapsproblemproofrecursiontopologicalbi-colored
0
0 comments X
read the original abstract

We prove, in a purely combinatorial way, the spectral curve topological recursion for the problem of enumeration of bi-colored maps, which are dual objects to dessins d'enfant. Furthermore, we give a proof of the quantum spectral curve equation for this problem. Then we consider the generalized case of 4-colored maps and outline the idea of the proof of the corresponding spectral curve topological recursion.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.