Asymptotic behaviour of the containment of certain mesh patterns
From MaRDI portal
Publication:2113370
Abstract: We present some results on the proportion of permutations of length containing certain mesh patterns as grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and columns are shaded. We prove some general results which apply to mesh patterns of any length, and then consider mesh patterns of length four. An important consequence of these results is to show that the proportion of permutations containing a mesh pattern can take a wide range of values between and .
Recommendations
- Distributions of several infinite families of mesh patterns
- Asymptotics of multicomponent linked polygons
- Asymptotic behavior of inflated lattice polygons
- scientific article; zbMATH DE number 4155810
- On some asymptotical shape problems
- Equivalence classes of mesh patterns with a dominating pattern
- Optimal meshes of curves in the Klein bottle
- A Jejune Heuristic Mesh Theorem
- Nearly optimal meshes in subanalytic sets
- The poset of mesh patterns
Cites work
- Avoidance of boxed mesh patterns on permutations
- Coincidence among families of mesh patterns
- Distributions of mesh patterns of short lengths
- Distributions of several infinite families of mesh patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Frame patterns in \(n\)-cycles
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Mesh patterns with superfluous mesh
- On the topology of complexes of injective words
- Patterns in permutations and words.
- Wilf-classification of mesh patterns of short length
This page was built for publication: Asymptotic behaviour of the containment of certain mesh patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113370)