Generalized permutation patterns -- a short survey
From MaRDI portal
Publication:3084741
zbMATH Open1217.05017arXiv0801.2412MaRDI QIDQ3084741FDOQ3084741
Authors: Einar Steingrímsson
Publication date: 25 March 2011
Abstract: An occurrence of a classical pattern p in a permutation pi is a subsequence of pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be required to be adjacent in the permutation. Subsets of permutations characterized by the avoidance--or the prescribed number of occurrences--of generalized patterns exhibit connections to an enormous variety of other combinatorial structures, some of them apparently deep. We give a short overview of the state of the art for generalized patterns.
Full work available at URL: https://arxiv.org/abs/0801.2412
Recommendations
Permutations, words, matrices (05A05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Cited In (35)
- Passing through a stack \(k\) times with reversals
- Enumeration schemes for vincular patterns
- Title not available (Why is that?)
- Occurrence graphs of patterns in permutations
- Title not available (Why is that?)
- Stanley-Wilf limits for patterns in rooted labeled forests
- Counting permutations by their rigid patterns
- Pattern frequency sequences and internal zeros
- A viewpoint for permutations with a low density of patterns
- On \(1324\)-avoiding permutations
- Patterns in permutations and words.
- Preface to the special issue of Permutation Patterns 2021 (PP2021)
- Vincular pattern avoidance on cyclic permutations
- Place-difference-value patterns: a generalization of generalized permutation and word patterns
- A linear time algorithm for consecutive permutation pattern matching
- On pattern avoiding indecomposable permutations
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- Passing through a stack k times
- The twelfth international conference on permutation patterns, 2014
- Mesh patterns with superfluous mesh
- Word-Representable Graphs: a Survey
- Generalized pattern avoidance
- Wilf equivalences between vincular patterns in inversion sequences
- Title not available (Why is that?)
- The patterns of permutations
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Equidistributions of mesh patterns of length two
- Generalized pattern frequency in large permutations
- Stack-sorting with consecutive-pattern-avoiding stacks
- From permutation patterns to the periodic table
- Applying the cluster method to count occurrences of generalized permutation patterns
- Stack-sorting preimages of permutation classes
- Wilf equivalences for patterns in rooted labeled forests
- A survey of consecutive patterns in permutations
- Title not available (Why is that?)
This page was built for publication: Generalized permutation patterns -- a short survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084741)