The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns
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'.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- August 1998
- DOI:
- 10.48550/arXiv.math/9808080
- arXiv:
- arXiv:math/9808080
- Bibcode:
- 1998math......8080N
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- AMSTeX