Add to ORKGThis paper is continuation of the study of the 1-box pattern in permutations in- troduced previously by the authors. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and then study some of its coefficients providing a link to the Fibonacci numbers. We also find the number of separable permutations with two and three occurrences of the 1-box pattern
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 12...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
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...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Let = 12 · · · be a permutation on {1 2 }. Define a pattern ̃ to be the string 1122 · ...
Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the requir...
Recently, Babson and Steingrımsson have introduced generalized permutation patterns that allow the r...
We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av...
AbstractRecently, Babson and Steingrı́msson have introduced generalized permutation patterns ...
This paper is a continuation of the systematic study of the distributions of simple marked mesh patt...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 12...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
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...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Let = 12 · · · be a permutation on {1 2 }. Define a pattern ̃ to be the string 1122 · ...
Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the requir...
Recently, Babson and Steingrımsson have introduced generalized permutation patterns that allow the r...
We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av...
AbstractRecently, Babson and Steingrı́msson have introduced generalized permutation patterns ...
This paper is a continuation of the systematic study of the distributions of simple marked mesh patt...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 12...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...