Generating and enumerating 321-avoiding and skew-merged simple permutations (Q1953536)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating and enumerating 321-avoiding and skew-merged simple permutations |
scientific article |
Statements
Generating and enumerating 321-avoiding and skew-merged simple permutations (English)
0 references
7 June 2013
0 references
Summary: The simple permutations in two permutation classes -- the \(321\)-avoiding permutations and the skew-merged permutations -- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permutations leads to the first truly structural enumeration of this class as a whole. The extension of this method to a wider collection of classes namely grid classes of infinite paths is discussed.
0 references
permutation pattern
0 references
simple permutation
0 references
enumeration of the simple skew-merged permutations
0 references