Enumerative combinatorics
Symmetric functions and P-Recursiveness
Journal of Combinatorial Theory Series A
Discrete Mathematics
Generating trees and the Catalan and Schro¨der numbers
Discrete Mathematics
Generating trees and forbidden subsequences
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Pattern matching for permutations
Information Processing Letters
Forbidden subsequences and Chebyshev polynomials
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Permutations with forbidden subsequences and a generalized Schröder number
Discrete Mathematics
Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations
Journal of Algebraic Combinatorics: An International Journal
Sorting with two ordered stacks in series
Theoretical Computer Science
Finite transition matrices for permutations avoiding pairs of length four patterns
Discrete Mathematics
Simple permutations: Decidability and unavoidable substructures
Theoretical Computer Science
Finitely labeled generating trees and restricted permutations
Journal of Symbolic Computation
Restricted k-ary words and functional equations
Discrete Applied Mathematics
Posets and permutations in the duplication-loss model: Minimal permutations with d descents
Theoretical Computer Science
Enumeration of some classes of words avoiding two generalized patterns of length three
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
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.