In this short note, we give a simple bijection from partitions of subsets of [n] to partitions of [n+1], in which enhanced k-crossings correspond to classical k-crossings. This resolves a recent conjecture of Zhicong Lin involving the binomial transform of the sequence that enumerates enhanced k-noncrossing partitions.Comment: 2 page
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Chen, Deng, Du, Stanley, and Yan introduced the notion of k-crossings and k-nestings for set partiti...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1...
We define and study noncommutative crossing partitions which are a generalization of non-crossing pa...
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks suc...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
International audienceWe give combinatorial proofs of the formulas for the number of multichains in ...
AbstractSchützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et al...
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in ...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
AbstractThe notion of noncrossing linked partition arose from the study of certain transforms in fre...
It is a updated version of a preprint entitled "On the symmetry of ascents and descents over 01-fill...
Abstract. We present results on the enumeration of crossings and nestings for matchings and set part...
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Chen, Deng, Du, Stanley, and Yan introduced the notion of k-crossings and k-nestings for set partiti...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1...
We define and study noncommutative crossing partitions which are a generalization of non-crossing pa...
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks suc...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
International audienceWe give combinatorial proofs of the formulas for the number of multichains in ...
AbstractSchützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et al...
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in ...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
AbstractThe notion of noncrossing linked partition arose from the study of certain transforms in fre...
It is a updated version of a preprint entitled "On the symmetry of ascents and descents over 01-fill...
Abstract. We present results on the enumeration of crossings and nestings for matchings and set part...
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Chen, Deng, Du, Stanley, and Yan introduced the notion of k-crossings and k-nestings for set partiti...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
Add to ORKG