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
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla et al.
Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman