Quadrant marked mesh patterns in 132-avoiding permutations. III.
From MaRDI portal
Abstract: Given a permutation in the symmetric group , we say that matches the marked mesh pattern in if there are at least points to the right of in which are greater than , at least points to the left of in which are greater than , at least points to the left of in which are smaller than , and at least points to the right of in which are smaller than . This paper is continuation of the systematic study of the distribution of quadrant marked mesh patterns in 132-avoiding permutations started in cite{kitremtie} and cite{kitremtieII} where we studied the distribution of the number of matches of in 132-avoiding permutations where at most two elements of of are greater than zero and the remaining elements are zero. In this paper, we study the distribution of the number of matches of in 132-avoiding permutations where at least three of are greater than zero. We provide explicit recurrence relations to enumerate our objects which can be used to give closed forms for the generating functions associated with such distributions. In many cases, we provide combinatorial explanations of the coefficients that appear in our generating functions.
Recommendations
Cited in
(7)- On the combinatorics of quadrant marked mesh patterns in 132-avoiding permutations
- Quadrant marked mesh patterns in 123-avoiding permutations
- The combinatorics of Jeff Remmel
- Quadrant marked mesh patterns in 132-avoiding permutations
- Quadrant marked mesh patterns in 132-avoiding permutations. II.
- Positional Marked Patterns in Permutations
- Singleton mesh patterns in multidimensional permutations
This page was built for publication: Quadrant marked mesh patterns in 132-avoiding permutations. III.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196523)