Add to ORKGWe exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set Sn(123) of 123-avoiding permutations in Sn. In particular, we show that the descents of a permutation correspond to valleys and triple ascents of the associated Dyck path. We get the Eulerian numbers of Sn(123) by studying the joint distribution of these two statistics on Dyck paths
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
AbstractWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of ...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine t...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding the cl...
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natura...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
AMS Subject Classication: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from the...
AMS Subject Classification: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from t...
We study the descent distribution over the set of centrosymmetric permu- tations that avoid a patter...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
AbstractThe diagram of a 132-avoiding permutation can easily be characterized: it is simply the diag...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
AbstractWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of ...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine t...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding the cl...
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natura...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
AMS Subject Classication: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from the...
AMS Subject Classification: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from t...
We study the descent distribution over the set of centrosymmetric permu- tations that avoid a patter...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
AbstractThe diagram of a 132-avoiding permutation can easily be characterized: it is simply the diag...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
AbstractWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of ...
Two combinatorial statistics, the pyramid weight and the number of exterior pairs, are investigated...
