Asymptotic Enumeration of Non-crossing Partitions on Surfaces
Juanjo Ru\'e, Ignasi Sau, and Dimitrios M. Thilikos

TL;DR
This paper extends the concept of non-crossing partitions from disks to general surfaces with boundary, showing that their exponential growth rate remains the same as Catalan numbers, using combinatorial and analytic techniques.
Contribution
It introduces a generalized notion of non-crossing partitions on arbitrary surfaces and proves their growth rate matches that of classical Catalan numbers.
Findings
Growth rate of non-crossing partitions on surfaces equals Catalan numbers
Uses bijective and analytic methods for enumeration
Results apply to general surfaces with boundary
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 of non-crossing partitions of a set of 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 is the same as the one of the -th Catalan number, i.e., does not change when we move from the case where is a disk to general surfaces with boundary.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · Stochastic processes and statistical mechanics
