AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding the classical pattern 3-1-2 and Dyck n-paths to study the joint distribution over the set Sn(3-1-2) of a given consecutive pattern of length 3 and of descents. We utilize a involution on Dyck paths due to E. Deutsch to show that these consecutive patterns split into 3 equidistribution classes. In addition, we state equidistribution theorems concerning quadruplets of statistics relative to occurrences of consecutive patterns of length 3 and of descents in a permutation
Descents in permutations or words are defined from the relative position of two consecutive letters....
AMS Subject Classification: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from t...
We present six articles: In the first and second article we give the first few results on generalize...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
none3We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding t...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine t...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
AbstractWe consider the problem of enumerating the permutations containing exactly k occurrences of ...
International audienceIn 2012 Bona showed the rather surprising fact that the cumulative number of o...
AbstractWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of ...
AMS Subject Classication: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from the...
We present a point of view on consecutive permutation patterns that interprets these in terms of (1)...
AbstractMotivated by a new point of view to study occurrences of consecutive patterns in permutation...
AbstractIn this paper we study the distribution of the number of occurrences of a permutation σ as a...
Descents in permutations or words are defined from the relative position of two consecutive letters....
AMS Subject Classification: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from t...
We present six articles: In the first and second article we give the first few results on generalize...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
none3We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding t...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine t...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
AbstractWe consider the problem of enumerating the permutations containing exactly k occurrences of ...
International audienceIn 2012 Bona showed the rather surprising fact that the cumulative number of o...
AbstractWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of ...
AMS Subject Classication: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from the...
We present a point of view on consecutive permutation patterns that interprets these in terms of (1)...
AbstractMotivated by a new point of view to study occurrences of consecutive patterns in permutation...
AbstractIn this paper we study the distribution of the number of occurrences of a permutation σ as a...
Descents in permutations or words are defined from the relative position of two consecutive letters....
AMS Subject Classification: 05A15, 05A05 Abstract. In this paper we introduce a new bijection from t...
We present six articles: In the first and second article we give the first few results on generalize...