The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns
classification
🧮 math.CO
keywords
patternsenumerationforbiddennumberpermutationsprescribedabcdalways
read the original 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'.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.