Symmetric functions and P-Recursiveness
Journal of Combinatorial Theory Series A
Discrete Mathematics
Generating trees and the Catalan and Schro¨der numbers
Discrete Mathematics
Permutations with forbidden subsequences and nonseparable planar maps
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Classification of forbidden subsequences of length 4
European Journal of Combinatorics
Generating trees and forbidden subsequences
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
A combinatorial proof of J. West's conjecture
Discrete Mathematics
Forbidden subsequences and Chebyshev polynomials
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
From Motzkin to Catalan permutations
Discrete Mathematics
Permutations with forbidden subsequences and a generalized Schröder number
Discrete Mathematics
Enumeration of vexillary involutions which are equal to their mirror/complement
Discrete Mathematics
An algebraic characterization of the set of succession rules
Theoretical Computer Science
Generating functions for generating trees
Discrete Mathematics
Finite transition matrices for permutations avoiding pairs of length four patterns
Discrete Mathematics
From object grammars to ECO systems
Theoretical Computer Science
Combinatorics of Permutations
Enumeration schemes for restricted permutations
Combinatorics, Probability and Computing
Finding regular insertion encodings for permutation classes
Journal of Symbolic Computation
| Hi-index | 0.00 |
Generating trees represent a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely many labels. Sometimes, however, this generating tree needs only finitely many labels. We characterize the finite sets of patterns for which this phenomenon occurs. We also present an algorithm - in fact, a special case of an algorithm of Zeilberger - that is guaranteed to find such a generating tree if it exists.