Permutations with one or two 132-subsequences

Discrete Mathematics

Volumn 181, Issue 1-3, 1998, Pages 267-274

  Bóna, Miklós ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000666279     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00062-9     Document Type: Article

References (11)

1. M. Bóna, Permutations avoiding certain patterns; the case of length 4 and generalizations, Discrete Math. (to appear).
2. P. Bóse, J.F. Buss, A. Lubiw, Pattern matching for permutations, in: Proceedings of the 3rd Workshop on Algorithms and Data Structures (1993) 200-209.
3. A. Cayley, On the partitions of a polygon, Proc. London Math. Soc. (1) 22 (1890-1891) 237-262.
4. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration (Wiley/Interscience, New York, 1983).
5. J. Noonan, The number of permutations containing exactly one increasing subsequence of length 3, Discrete Math. 152 (1996) 307-313.
6. J. Noonan, D. Zeilberger, The enumeration of permutations with a prescribed number of "forbidden" subsequences, Adv. Appl. Math. 17 (1996) 381-407.
7. R. Simion, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
8. R.P. Stanley, Differentiably finite power series, European J. Combin. 1 (1980) 175-188.
9. R.P. Stanley, Enumerative Combinatorics Vol. 1 (Wadsworth and Brooks, Belmont, CA, 1986).
10. J. West, Permutations with forbidden subsequences; and, Stack sortable permutations, PhD Thesis, Massachusetts Institute of Technology, Cambridge, MA (1990).
11. H. Wilf, R. Stanley, oral communication.