Enumeration schemes for restricted permutations

Details Enumeration schemes for restricted permutations Enumeration schemes for restricted permutations

2005-10-03

arxiv.org/abs/math/0510044v1

Mathematics

Combinatorics

21 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumeration schemes for 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 Enumeration schemes for restricted permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration schemes for restricted permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134519