Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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 four-colored maps and outline the idea of the proof of the corresponding spectral curve topological recursion.
Gian Florin Gentinetta, Stefan Woerner