Quadrant marked mesh patterns in 123-avoiding permutations

From MaRDI portal




Abstract: Given a permutation sigma=sigma1ldotssigman in the symmetric group mathcalSn, we say that sigmai matches the quadrant marked mesh pattern mathrmMMP(a,b,c,d) in sigma if there are at least a points to the right of sigmai in sigma which are greater than sigmai, at least b points to the left of sigmai in sigma which are greater than sigmai, at least c points to the left of sigmai in sigma which are smaller than sigmai, and at least d points to the right of sigmai in sigma which are smaller than sigmai. Kitaev, Remmel, and Tiefenbruck systematically studied the distribution of the number of matches of mathrmMMP(a,b,c,d) in 132-avoiding permutations. The operation of reverse and complement on permutations allow one to translate their results to find the distribution of the number of mathrmMMP(a,b,c,d) matches in 231-avoiding, 213-avoiding, and 312-avoiding permutations. In this paper, we study the distribution of the number of matches of mathrmMMP(a,b,c,d) in 123-avoiding permutations. 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.











This page was built for publication: Quadrant marked mesh patterns in 123-avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560195)