Avoidance of boxed mesh patterns on permutations
From MaRDI portal
Publication:1759862
DOI10.1016/j.dam.2012.08.015zbMath1254.05004OpenAlexW2024075615MaRDI QIDQ1759862
Alexandr Valyuzhenich, Sergey Kitaev, Sergei V. Avgustinovich
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.015
enumerationgeneralized Catalan numbersErdősStanley-Wilf conjectureboxed mesh patternSzekeres theorem
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items
The poset of mesh patterns ⋮ Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem ⋮ Harmonic numbers, Catalan's triangle and mesh patterns ⋮ Equidistributions of mesh patterns of length two ⋮ An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem ⋮ Unnamed Item ⋮ Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures ⋮ Distributions of several infinite families of mesh patterns ⋮ Mesh patterns with superfluous mesh ⋮ Distributions of mesh patterns of short lengths ⋮ Frame patterns in \(n\)-cycles ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ \((a, b)\)-rectangle patterns in permutations and words ⋮ Asymptotic behaviour of the containment of certain mesh patterns
Uses Software
