In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections between a set of bounded cornerless Motzkin paths and a set of $t$-core partitions, and a set of bounded cornerless symmetric Motzkin paths and a set of self-conjugate $t$-core partitions. As an application, we get explicit formulas for the number of ordinary and self-conjugate $t$-core partitions with a fixed number of corners.Comment: 19 pages, 8 figures, 2 table
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
AbstractFor fixed positive integer k, let En denote the set of lattice paths using the steps (1,1), ...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natura...
Communicated by (xxxxxxxxxx) In the literature, many bijections between (labeled) Motzkin paths and ...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
AbstractFor fixed positive integer k, let En denote the set of lattice paths using the steps (1,1), ...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natura...
Communicated by (xxxxxxxxxx) In the literature, many bijections between (labeled) Motzkin paths and ...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...