AMS Subject Classication: 05 Abstract. We provide a bijection between the permutations in Sn that avoid 3412 and contain exactly one 321 pattern with the permutations in Sn+1 that avoid 321 and contain exactly one 3412 pattern. The enumeration of these classes is obtained from their classication via reduced decompositions. The results are extended to involutions in the above pattern classes using reduced decompositions reproducing a result of Egge
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 12...
We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av...
In 1985, Simion and Schmidt showed that |Sn(τ3)|, the cardinality of the set of all length n permuta...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractThe 321, hexagon-avoiding (321-hex) permutations were introduced and studied by Billey and W...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
This paper is continuation of the study of the 1-box pattern in permutations in- troduced previously...
This paper is continuation of the study of the 1-box pattern in permutations in-troduced previously ...
We use combinatorial and generating function techniques to enumerate various sets of involutions wh...
This paper is continuation of the study of the 1-box pattern in permutations in- troduced previously...
AbstractGiven a permutation w, we show that the number of repeated letters in a reduced decompositio...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 12...
We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av...
In 1985, Simion and Schmidt showed that |Sn(τ3)|, the cardinality of the set of all length n permuta...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractThe 321, hexagon-avoiding (321-hex) permutations were introduced and studied by Billey and W...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
This paper is continuation of the study of the 1-box pattern in permutations in- troduced previously...
This paper is continuation of the study of the 1-box pattern in permutations in-troduced previously ...
We use combinatorial and generating function techniques to enumerate various sets of involutions wh...
This paper is continuation of the study of the 1-box pattern in permutations in- troduced previously...
AbstractGiven a permutation w, we show that the number of repeated letters in a reduced decompositio...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...