Enumeration schemes for restricted permutations

Vincent Vatter

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)137-159
Number of pages23
JournalCombinatorics, Probability and Computing
Volume17
Issue number1
DOIs
Publication statusPublished - Jan 2008

Fingerprint

Dive into the research topics of 'Enumeration schemes for restricted permutations'. Together they form a unique fingerprint.

Cite this