Finitely labeled generating trees and restricted permutations

Details Finitely labeled generating trees and restricted permutations Finitely labeled generating trees and restricted permutations

2003-09-15

arxiv.org/abs/math/0309238v2

Mathematics

Combinatorics

Accepted by J. Symb. Comp.; 12 pages

Scientific paper

Generating trees are 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.

Affiliated with

Also associated with

No associations

Rating

Finitely labeled generating trees and restricted permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finitely labeled generating trees and restricted permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finitely labeled generating trees and restricted permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511729