Counting non-crossing permutations on surfaces of any genus

Research output: Contribution to journalArticleResearchpeer-review


Given a surface with boundary and some points on the boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on the surface. If only bigons are allowed, then one obtains the notion of arc diagrams, whose enumeration is known to have a rich structure. We show that the count of polygon diagrams on surfaces with any genus and number of boundary components exhibits similar structure. In particular it is almost polynomial in the number of points on the boundary components, and the leading coefficients of those polynomials are intersection numbers on compactified moduli spaces of curves.

Original languageEnglish
Article numberP4.9
Number of pages47
JournalThe Electronic Journal of Combinatorics
Issue number4
Publication statusPublished - 22 Oct 2021

Cite this