The Number of Permutations with Exactly r 132-Subsequences Is P-Recursive in the Size!

Advances in Applied Mathematics

Volumn 18, Issue 4, 1997, Pages 510-522

  Bóna, Miklós ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000437048     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1997.0528     Document Type: Article

References (11)

1. M. Bóna, Permutations with one or two 132-subsequences, Discr. Math.
2. M. Bóna, Permutations avoiding certain patterns; The case of length 4 and generalizations, Discr. Math.
3. P. Bose, J. F. Buss, A. Lubiw, Pattern matching for permutations, Proceedings, 3rd Workshop on Algorithms and Data Structures, 1993, 200, 209.
4. Gessel I. M. Symmetric functions andP. J. Combin. Theory Ser. A. 53:1990;257-285.
5. Noonan J. The number of permutations containing exactly one increasing subsequence of length 3. Discr. Math. 152:1996;307-313.
6. Simion R., Schmidt F. W. Restricted permutations. Europ. J. Combin. 6:1985;383-406.
7. Stanley R. P. Differentiably finite power series. European Journal of Combinatorics. 1:1980;175-188.
8. J. West, 1990, Permutations with Forbidden Subsequences and Stack Sortable Permutations, Massachusetts Institute of Technology.
9. H. Wilf, R. Stanley.
10. Noonan J., Zeilberger D. The enumeration of permutations with a prescribed number of "forbidden" subsequences. Adv. in Appl. Math. 17:1996;381-407.
11. Zeilberger D. Holonomic systems for special functions. J. Comput. Appl. Math. 32:1990;321-368.