Permutations avoiding certain patterns: The case of length 4 and some generalizations

Discrete Mathematics

Volumn 175, Issue 1-3, 1997, Pages 55-67

  Bóna, Miklós ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002921232     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00140-9     Document Type: Article

References (7)

1. 4 are Wilf equivalent, SIAM J. Discrete Math., submitted.
2. P. Bose, J.F. Buss and A. Lubiw, Pattern matching for permutations, Proc. 6th Workshop on Algorithms and Data Structures, 1993.
3. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math. 41 (1981) 115-136.
4. R. Simion and F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
5. Z. Stankova, Forbidden subsequences, Discrete Math. 132 (1994) 291-316.
6. J. West, Permutations with forbidden subsequences, Ph.D. Thesis, Massachusetts Institute of Technology, 1990.
7. J. West, Wilf-equivalence for singleton classes, preprint.