Add to ORKGWe consider an animal S as a set of points in the coordinate plane that are reachable from the origin (0, 0) through points in S by steps from {(1, 0), (0, 1), (1, 1), (−1, −1)}. In this paper, we give a combinatorial bijection with 2-Motzkin paths, i.e., the Motzkin paths with two different horizontal steps.
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by ...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
Abstract. A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, t...
Motzkin paths are integer lattice paths that use steps U=(1,1), L=(1,0), D=(1,-1) and stay weakly ab...
Abstract. A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, t...
Motzkin paths with air pockets (MAP) of the first kind are defined as a generalization of Dyck paths...
AbstractFor fixed positive integer k, let En denote the set of lattice paths using the steps (1,1), ...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
Abstract: Consider lattice paths in the plane allowing the steps (1,1), (1,-1), and (w,0), for some ...
Click on the link to view the abstract. Keywords: Motzkin paths; Dyck paths; peaks; valleys; generat...
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...
The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by ...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
Abstract. A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, t...
Motzkin paths are integer lattice paths that use steps U=(1,1), L=(1,0), D=(1,-1) and stay weakly ab...
Abstract. A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, t...
Motzkin paths with air pockets (MAP) of the first kind are defined as a generalization of Dyck paths...
AbstractFor fixed positive integer k, let En denote the set of lattice paths using the steps (1,1), ...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
Abstract: Consider lattice paths in the plane allowing the steps (1,1), (1,-1), and (w,0), for some ...
Click on the link to view the abstract. Keywords: Motzkin paths; Dyck paths; peaks; valleys; generat...
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...
The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by ...
20 pages, 11 figuresA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whe...