Sorting probability of Catalan posets
Swee Hong Chan, Igor Pak, and Greta Panova
TL;DR
This paper establishes that the probability of sorting Catalan posets decreases at a rate proportional to n^{-5/4}, providing insight into their combinatorial structure.
Contribution
It proves an upper bound on the sorting probability of Catalan posets, a novel result in the combinatorics of posets.
Findings
Sorting probability of Catalan posets is O(n^{-5/4})
Provides new bounds on combinatorial sorting processes
Advances understanding of Catalan poset structure
Abstract
We show that the sorting probability of the Catalan poset} satisfies .
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.