Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
