Regular Article: The Enumeration of Permutations with a Prescribed Number of 驴Forbidden驴 Patterns

Authors:
John Noonan;Doron Zeilberger
Affiliations:
Department of Mathematics, Temple University, Philadelphia, Pennsylvania, 19122;Department of Mathematics, Temple University, Philadelphia, Pennsylvania, 19122
Venue:
Advances in Applied Mathematics
Year:
1996

Citing 0
Cited 5

The patterns of permutations

Discrete Mathematics - Kleitman and combinatorics: a celebration
Continued fractions and generalized patterns

European Journal of Combinatorics
Pattern frequency sequences and internal zeros

Advances in Applied Mathematics - Special issue: Memory of Rodica Simon
Restricted permutations and the wreath product

Discrete Mathematics
Restricted k-ary words and functional equations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

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