Asymptotic Enumeration of Non-crossing Partitions on Surfaces
Abstract
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface and introduce the number C(n) of non-crossing partitions of a set of n points laying on the boundary of . Our proofs use bijective techniques arising from map enumeration, joint with the symbolic method and singularity analysis on generating functions. An outcome of our results is that the exponential growth of C(n) is the same as the one of the n-th Catalan number, i.e., does not change when we move from the case where is a disk to general surfaces with boundary.
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.