A self-dual poset on objects counted by the Catalan numbers and a type-B analogue
Miklós Bóna, Rodica Simion
Abstract
We introduce two partially ordered sets, PAn and PBn, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of PAn and PBn are subsets of the symmetric and the hyperoctahedral groups, consisting of permutations which avoid certain patterns. The order relation is given by (strict) containment of the descent sets. In each case, by means of an explicit order-preserving bijection, we show that the poset of restricted permutations is an extension of the refinement order on noncrossing partitions. Several structural properties of these permutation posets follow, including self-duality and the strong Sperner property. We also discuss posets QAn and QBn similarly associated with noncrossing partitions, defined by means of the excedence sets of suitable pattern-avoiding subsets of the symmetric and hyperoctahedral groups.
Create a lesson
Related papers
A face polynomial invariant for embedded graphs
Hongxia Ma, Metrose Metsidik
Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
Michael C. Burkhart
The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs
Juan Wang, Genjie Wang
A Low-Diameter Nash-Williams--Tutte Theorem
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai et al.
A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
Andrew D. Lin
Automaticity of structural defects in fixed points of block substitutions
Lior Tenenbaum