Restricted permutations

DOI10.1016/S0012-365X(98)00162-9zbMath0932.05002OpenAlexW2914427938WikidataQ59567609 ScholiaQ59567609MaRDI QIDQ5906401

No author found.

Publication date: 3 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00162-9

zbMATH Keywords

enumerationsequenceclosed setsrestricted permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Restricted permutations and queue jumping ⋮ Labelled well-quasi-order for permutation classes ⋮ Decomposing simple permutations, with enumerative consequences ⋮ Sorting by shuffling methods and a queue ⋮ Square permutations are typically rectangular ⋮ Partial permutations avoiding pairs of patterns ⋮ Enumerating two permutation classes by the number of cycles ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ Regular closed sets of permutations. ⋮ Automatic discovery of structural rules of permutation classes ⋮ Composability of permutation classes ⋮ On the longest upsequence problem for permutations ⋮ Pattern classes of permutations via bijections between linearly ordered sets ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Juxtaposing Catalan permutation classes with monotone ones ⋮ On the growth of merges and staircases of permutation classes ⋮ Restricted 132-avoiding permutations ⋮ Restricted permutations ⋮ Counting occurrences of 231 in an involution ⋮ Letter graphs and geometric grid classes of permutations: characterization and recognition ⋮ Unnamed Item ⋮ Restricted \(k\)-ary words and functional equations ⋮ Combinatorial specifications for juxtapositions of permutation classes ⋮ Geometric grid classes of permutations ⋮ Growth rates of permutation grid classes, tours on graphs, and the spectral radius ⋮ Sorting with two ordered stacks in series. ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Forbidden subsequences
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Permutations with one or two 132-subsequences
• Generating trees and the Catalan and Schröder numbers
• Partitioning permutations into increasing and decreasing subsequences
• The number of permutations containing exactly one increasing subsequence of length three
• Classification of forbidden subsequences of length 4
• Generating trees and forbidden subsequences
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Pattern matching for permutations
• Sorting Using Networks of Queues and Stacks
• Restricted permutations
• Restricted permutations