We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijections between Motzkin paths and two families of restricted involutions that are counted by Motzkin numbers, namely, involutions avoiding 4321 and 3412. As a consequence, we derive characterizations of Motzkin paths corresponding to involutions avoiding either 4321 or 3412 together with any pattern of length 3. Furthermore, we exploit the described bijection to study some notable subsets of the set of restricted involutions, namely, fixed point free and centrosymmetric restricted involutions
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
Motzkin paths are integer lattice paths that use steps U=(1,1), L=(1,0), D=(1,-1) and stay weakly ab...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
Let Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper concerns the ...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
AbstractLet Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper conce...
In this paper we describe a method to enumerate combinatorial avoidance classes for Motzkin paths au...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
Motzkin paths are integer lattice paths that use steps U=(1,1), L=(1,0), D=(1,-1) and stay weakly ab...
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijection...
AbstractWe show how a bijection due to Biane between involutions and labelled Motzkin paths yields b...
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduc...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded...
Let Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper concerns the ...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
We study the fine structure of the sets I(4321) and I(321) connecting the point of wiew of the subst...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
AbstractLet Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper conce...
In this paper we describe a method to enumerate combinatorial avoidance classes for Motzkin paths au...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
Motzkin paths are integer lattice paths that use steps U=(1,1), L=(1,0), D=(1,-1) and stay weakly ab...