arXiv Analytics

Sign in

arXiv:math/9808080 [math.CO]AbstractReferencesReviewsResources

The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns

John Noonan, Doron Zeilberger

Published 1998-08-17Version 1

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'.

Comments: AMSTeX
Journal: Advances in Applied Mathematics 17 (1996), 381-407
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/9903170 [math.CO] (Published 1999-03-29)
The Number of Permutations With A Prescribed Number of 132 and 123 Patterns
arXiv:math/0607793 [math.CO] (Published 2006-07-31)
Permutations, cycles, and the pattern 2-13
arXiv:1108.3249 [math.CO] (Published 2011-08-16, updated 2013-06-21)
A short note on the Stanley-Wilf Conjecture for permutations on multisets

Links

Toolbox