Generalized permutation patterns -- a short survey
From MaRDI portal
Publication:3084741
zbMath1217.05017arXiv0801.2412MaRDI QIDQ3084741
Publication date: 25 March 2011
Full work available at URL: https://arxiv.org/abs/0801.2412
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05)
Related Items (17)
Word-Representable Graphs: a Survey ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ Equidistributions of mesh patterns of length two ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ Enumeration schemes for vincular patterns ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Stack-sorting preimages of permutation classes ⋮ Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ Passing through a stack k times ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ On \(1324\)-avoiding permutations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ On pattern avoiding indecomposable permutations ⋮ Mesh patterns with superfluous mesh ⋮ Passing through a stack \(k\) times with reversals
This page was built for publication: Generalized permutation patterns -- a short survey
