Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three

We consider the problem of enumerating the permutations containing exactly k occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bijections from permutations to certain lattice paths with ''jumps,'' which were first considered by Krattenthaler.

[1]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[2]  N. S. Barnett,et al.  Private communication , 1969 .

[3]  Miklós Bóna.  Permutations with one or two 132-subsequences , 1998, Discret. Math..

[4]  John Noonan.  The number of permutations containing exactly one increasing subsequence of length three , 1996, Discret. Math..

[5]  Eric S. Egge.  Restricted permutations related to Fibonacci numbers and k-generalized Fibonacci numbers , 2001 .

[6]  Miklós Bóna,et al.  Permutations avoiding certain patterns: The case of length 4 and some generalizations , 1997, Discret. Math..

[7]  T. Mansour,et al.  Restricted 132-Avoiding Permutations , 2000, Adv. Appl. Math..

[8]  Toufik Mansour,et al.  Restricted Permutations, Continued Fractions, and Chebyshev Polynomials , 2000, Electron. J. Comb..

[9]  Mike D. Atkinson,et al.  Restricted permutations , 1999, Discret. Math..

[10]  D. Zeilberger,et al.  The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns , 1996, math/9808080.

[11]  Miklós Bóna.  Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps , 1997, J. Comb. Theory, Ser. A.

[12]  Christian Krattenthaler,et al.  Permutations with Restricted Patterns and Dyck Paths , 2000, Adv. Appl. Math..

[13]  Toufik Mansour,et al.  Counting Occurrences of 132 in a Permutation , 2002, Adv. Appl. Math..

[14]  T. Mansour,et al.  Restricted permutations and Chebyshev polynomials. , 2002 .

[15]  Doron Zeilberger,et al.  Permutation Patterns and Continued Fractions , 1999, Electron. J. Comb..

[16]  Aaron Robertson.  Permutations Restricted by Two Distinct Patterns of Length Three , 2001, Adv. Appl. Math..

[17]  T. Mansour,et al.  Layered Restrictions and Chebyshev Polynomials , 2000 .

[18]  Alberto Del Lungo,et al.  Permutations avoiding an increasing number of length-increasing forbidden subsequences , 2000, Discret. Math. Theor. Comput. Sci..

[19]  M. Bóna,et al.  The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size! , 1997 .

[20]  Julian West,et al.  Permutations with forbidden subsequences, and, stack-sortable permutations , 1990 .