Enumeration schemes for restricted permutations

Simple item page
dc.creatorVatter, Vincent
dc.date2005-10-03
dc.date.accessioned2026-07-07T06:20:35Z
dc.date.available2026-07-07T06:20:35Z
dc.descriptionZeilberger'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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/math/0510044
dc.identifierhttp://arxiv.org/abs/math/0510044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95362
dc.subjectCombinatorics
dc.titleEnumeration schemes for restricted permutations
dc.typetext

Files

Collections

arXiv