Enumeration Schemes for Restricted Permutations

DOI10.1017/S0963548307008516zbMath1133.05004arXivmath/0510044WikidataQ60692305 ScholiaQ60692305MaRDI QIDQ5448994

Vincent R. Vatter

Publication date: 10 March 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0510044

zbMATH Keywords

generating treesMaple packageinsertion encodingsubstitution decompositions

Mathematics Subject Classification ID

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

Related Items (11)

Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Permutation pattern avoidance and the Catalan triangle ⋮ Pattern avoidance in ordered set partitions ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ The number of {1243, 2134}-avoiding permutations ⋮ Enumeration schemes for vincular patterns ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Automatic discovery of structural rules of permutation classes ⋮ The enumeration of maximally clustered permutations ⋮ Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents ⋮ Restricted \(k\)-ary words and functional equations

Uses Software

• Maple
• OEIS

Cites Work

• Pattern matching for permutations
• Partially well-ordered closed sets of permutations
• Symmetric functions and P-recursiveness
• Complement reducible graphs
• The number of Baxter permutations
• Forbidden subsequences and Chebyshev polynomials
• Enumeration schemes and, more importantly, their automatic generation
• Forbidden subsequences
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Freely braided elements in Coxeter groups.
• Explicit enumeration of 321, hexagon-avoiding permutations
• Sorting with two ordered stacks in series.
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• Permutations with forbidden subsequences and a generalized Schröder number
• Finitely labeled generating trees and restricted permutations
• On the equivalence problem for succession rules
• Simple permutations and pattern restricted permutations
• What is an Answer?
• ECO:a methodology for the enumeration of combinatorial objects
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations

This page was built for publication: Enumeration Schemes for Restricted Permutations