Generalisations of the Harer-Zagier recursion for 1-point functions

Abstract

Harer and Zagier proved a recursion to enumerate gluings of a 2d-gon that result in an orientable genus g surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other enumerative problems, so it is natural to pose the following question: how large is the family of problems for which these so-called 1-point recursions exist? In this paper, we prove the existence of 1-point recursions for a class of enumerative problems that have Schur function expansions. In particular, we recover the Harer-Zagier recursion, but our methodology also applies to the enumeration of dessins d'enfant, to Bousquet-M\'elou-Schaeffer numbers, to monotone Hurwitz numbers, and more. On the other hand, we prove that there is no 1-point recursion that governs simple Hurwitz numbers. Our results are effective in the sense that one can explicitly compute particular instances of 1-point recursions, and we provide several examples. We conclude the paper with a brief discussion and a conjecture relating 1-point recursions to the theory of topological recursion.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…