Quadrant marked mesh patterns in 132-avoiding permutations II
From MaRDI portal
Publication:5262032
zbMATH Open1318.05008arXiv1302.2274MaRDI QIDQ5262032FDOQ5262032
Mark Tiefenbruck, Jeffrey Remmel, Sergey Kitaev
Publication date: 9 July 2015
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} where we mainly studied the distribution of the number of matches of in 132-avoiding permutations where exactly one of is 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 exactly two of are greater than zero and the remaining elements are 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. The case of quadrant marked mesh patterns where three or more of are constrained to be greater than 0 will be studied in cite{kitremtieIII}.
Full work available at URL: https://arxiv.org/abs/1302.2274
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)
Cited In (3)
Uses Software
This page was built for publication: Quadrant marked mesh patterns in 132-avoiding permutations II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262032)