DOIAbstract
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}1n such that 1⩽si⩽i, and if si=j, then si-r⩽j-r for 1⩽r⩽j-1
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}1n such that 1⩽si⩽i, and if si=j, then si-r⩽j-r for 1⩽r⩽j-1
AbstractOne basic activity in combinatorics is to establish combinatorial identities by so-called ‘b...
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Given a sequence A = (a1, …, an) of real numbers, a block B of A is either a set B = {ai, ai+1, …, a...
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks suc...
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1...
In this short note, we give a simple bijection from partitions of subsets of [n] to partitions of [n...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
AbstractA formula is established for the number of chains with designated ranks in the non-crossing ...
AbstractWe characterize sequences of positive integers (m1,…,mp),m1⩾…⩾mp>0, for which the productn×k...
Partitions with gaps. Bijections between various restricted partitions of integers have been extensi...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
AbstractSchützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et al...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe construct a bijection proving that the following two sets have the same cardinality: (i) ...
AbstractOne basic activity in combinatorics is to establish combinatorial identities by so-called ‘b...
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Given a sequence A = (a1, …, an) of real numbers, a block B of A is either a set B = {ai, ai+1, …, a...
AbstractWe present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks suc...
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1...
In this short note, we give a simple bijection from partitions of subsets of [n] to partitions of [n...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
AbstractA formula is established for the number of chains with designated ranks in the non-crossing ...
AbstractWe characterize sequences of positive integers (m1,…,mp),m1⩾…⩾mp>0, for which the productn×k...
Partitions with gaps. Bijections between various restricted partitions of integers have been extensi...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
AbstractSchützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et al...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe construct a bijection proving that the following two sets have the same cardinality: (i) ...
AbstractOne basic activity in combinatorics is to establish combinatorial identities by so-called ‘b...
AbstractUsing the bijection between partitions and vacillating tableaux, we establish a corresponden...
Given a sequence A = (a1, …, an) of real numbers, a block B of A is either a set B = {ai, ai+1, …, a...
Add to ORKG