Quadrant marked mesh patterns in 132-avoiding permutations I
Sergey Kitaev, Jeffrey Remmel, Mark Tiefenbruck

TL;DR
This paper investigates the distribution of quadrant marked mesh patterns in 132-avoiding permutations, focusing on cases where only one parameter is non-zero, extending previous systematic studies in permutation pattern analysis.
Contribution
It provides a detailed analysis of the distribution of specific quadrant marked mesh patterns in 132-avoiding permutations, focusing on single-parameter cases, and sets the stage for future multi-parameter studies.
Findings
Distribution formulas for MMP(a,b,c,d) with one non-zero parameter
Characterization of pattern occurrences in 132-avoiding permutations
Foundation for analyzing more complex pattern distributions
Abstract
This paper is a continuation of the systematic study of the distributions of quadrant marked mesh patterns initiated in [6]. Given a permutation in the symmetric group , we say that matches the quadrant marked mesh pattern if there are at least elements to the right of in that are greater than , at least elements to left of in that are greater than , at least elements to left of in that are less than , and at least elements to the right of in that are less than . We study the distribution of in 132-avoiding permutations. In particular, we study the distribution of , where only one of the parameters are non-zero. In a subsequent paper [7], we will study the the distribution of in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algorithms and Data Compression · Coding theory and cryptography
