The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns
Combinatorics
2007-05-23 v1
Abstract
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns `abc',`cab' and `abcd'.
Keywords
Cite
@article{arxiv.math/9808080,
title = {The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns},
author = {John Noonan and Doron Zeilberger},
journal= {arXiv preprint arXiv:math/9808080},
year = {2007}
}
Comments
AMSTeX