Generalized permutation patterns - a short survey
By Einar Steingrímsson. 2008
55 citations recorded by the source corpus.
An occurrence of a classical pattern p in a permutation π is a subsequence of π 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.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/7fa8ad2c205738047c0d9a877a480e1f73f04d52
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Discrete Mathematics and Combinatorics
In Electrical and Electronic Engineering
Citations in the corpus
- Permutation classes (2014, background): “While the work of Jeĺınek and Valtr [105] focuses on the abstract notions of splittability, the earlier work of Claesson, Jeĺınek, and Steingŕımsson [76] was concerned with the applications of Propositions 3.5 and (their version of) 3.7 to growth rates of principal classes with layered basis elem”