Enumeration Schemes for Restricted Permutations
From MaRDI portal
Abstract: Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
Recommendations
- Enumeration schemes for words avoiding permutations
- Enumeration schemes for vincular patterns
- Refining enumeration schemes to count according to the inversion number
- Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
- Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
Cites work
- Complement reducible graphs
- ECO:a methodology for the enumeration of combinatorial objects
- Enumeration schemes and, more importantly, their automatic generation
- Explicit enumeration of 321, hexagon-avoiding permutations
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Finitely labeled generating trees and restricted permutations
- Forbidden subsequences
- Forbidden subsequences and Chebyshev polynomials
- Freely braided elements in Coxeter groups.
- Generating trees and forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- On the equivalence problem for succession rules
- Partially well-ordered closed sets of permutations
- Pattern matching for permutations
- Permutations with forbidden subsequences and a generalized Schröder number
- Simple permutations and pattern restricted permutations
- Sorting with two ordered stacks in series.
- Symmetric functions and P-recursiveness
- The number of Baxter permutations
- What is an Answer?
Cited in
(28)- Restricted k-ary words and functional equations
- Enumeration schemes and, more importantly, their automatic generation
- Enumeration by stabilizer class of patterns with local restrictions
- Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
- Enumeration of restricted permutation triples
- Subregularity in infinitely labeled generating trees of restricted permutations
- Restricted signed permutations counted by the Schröder numbers
- The insertion encoding of permutations
- Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
- Refining enumeration schemes to count according to the inversion number
- Enumeration schemes for words avoiding permutations
- Permutation pattern avoidance and the Catalan triangle
- Enumerating Nondegenerate Permutations
- Pattern avoidance in ordered set partitions
- Refining enumeration schemes to count according to permutation statistics
- Enumeration schemes for vincular patterns
- Automatic discovery of structural rules of permutation classes
- scientific article; zbMATH DE number 6960762 (Why is no real title available?)
- An improved generalized enumeration of substitution systems
- Enumeration of permutation classes and weighted labelled independent sets
- scientific article; zbMATH DE number 6269007 (Why is no real title available?)
- On the effective and automatic enumeration of polynomial permutation classes
- The number of {1243, 2134}-avoiding permutations
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- The enumeration of maximally clustered permutations
- Combinatorial exploration: an algorithmic framework for enumeration
- Enumerating anchored permutations with bounded gaps
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
This page was built for publication: Enumeration Schemes for Restricted Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448994)
