A sefl-dual poset on objects counted by the Catalan numbers
Miklos Bona
Abstract
We examine the poset P of 132-avoiding n-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset Q of noncrossing partitions . In other words, if x<y in Q, then f(y)<f(x) in P, where f is the canonical bijection from the set of noncrossing partitions onto that of 132-avoiding permutations. This enables us to prove many properties of P.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.