论文信息 - Permutations with one or two 132-subsequences

Permutations with one or two 132-subsequences

We prove a strikingly simple formula for the number of permutations containing exactly one subsequence of type 132. We show that this number equals the number of partitions of a convex (n + 1 )-gon into n 2 parts by noncrossing diagonals. We also prove a recursive formula for the number d, of those containing exactly two such subsequences, yielding that {d,} is P-recursive. (~) 1998 Elsevier Science B.V.

Mikl6s B6na

[1] Prosenjit Bose,et al. Pattern Matching for Permutations , 1993, WADS.

[2] Cayley. On the Partitions of a Polygon , 1890 .

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

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

[5] Richard P. Stanley,et al. Differentiably Finite Power Series , 1980, Eur. J. Comb..

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