English

Quadrant marked mesh patterns in 132-avoiding permutations I

Combinatorics 2014-07-09 v3

Abstract

This paper is a continuation of the systematic study of the distributions of quadrant marked mesh patterns initiated in [6]. Given a permutation \sg=\sg1...\sgn\sg = \sg_1 ... \sg_n in the symmetric group SnS_n, we say that \sgi\sg_i matches the quadrant marked mesh pattern MMP(a,b,c,d)MMP(a,b,c,d) if there are at least aa elements to the right of \sgi\sg_i in \sg\sg that are greater than \sgi\sg_i, at least bb elements to left of \sgi\sg_i in \sg\sg that are greater than \sgi\sg_i, at least cc elements to left of \sgi\sg_i in \sg\sg that are less than \sgi\sg_i, and at least dd elements to the right of \sgi\sg_i in \sg\sg that are less than \sgi\sg_i. We study the distribution of MMP(a,b,c,d)MMP(a,b,c,d) in 132-avoiding permutations. In particular, we study the distribution of MMP(a,b,c,d)MMP(a,b,c,d), where only one of the parameters a,b,c,da,b,c,d are non-zero. In a subsequent paper [7], we will study the the distribution of MMP(a,b,c,d)MMP(a,b,c,d) in 132-avoiding permutations where at least two of the parameters a,b,c,da,b,c,d are non-zero.

Keywords

Cite

@article{arxiv.1201.6243,
  title  = {Quadrant marked mesh patterns in 132-avoiding permutations I},
  author = {Sergey Kitaev and Jeffrey Remmel and Mark Tiefenbruck},
  journal= {arXiv preprint arXiv:1201.6243},
  year   = {2014}
}

Comments

Theorem 10 is corrected

R2 v1 2026-06-21T20:11:51.379Z