AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1,2,…,n} is equal to the sum of weights of Motzkin paths of length n, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
(Communicated by Jery N. Kahn) Abstract. Kreweras considered the problem of counting noncrossing par...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
AbstractThe notion of noncrossing linked partition arose from the study of certain transforms in fre...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
Schützenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's corr...
Abstract: Consider lattice paths in the plane allowing the steps (1,1), (1,-1), and (w,0), for some ...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
(Communicated by Jery N. Kahn) Abstract. Kreweras considered the problem of counting noncrossing par...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
AbstractThe notion of noncrossing linked partition arose from the study of certain transforms in fre...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
Schützenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's corr...
Abstract: Consider lattice paths in the plane allowing the steps (1,1), (1,-1), and (w,0), for some ...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
(Communicated by Jery N. Kahn) Abstract. Kreweras considered the problem of counting noncrossing par...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...