On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Arratia, Richard ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008333462     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1477     Document Type: Article

References (10)

1. Alon, N., and Friedgut, E. (1999) On the number of permutations avoiding a given pattern. J. Combinatorial Theory, Ser. A, to appear
2. Bóna, M. (1997) Exact and asymptotic enumeration of permutations with subsequence conditions. Ph.D. Thesis, M.I.T.
3. Bóna, M. (1999) The solution of a conjecture of Stanley and Wilf for all layered patterns. J. Combinatorial Theory, Ser. A 85, 96-104.
4. Fekete, M. (1923) Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzähligen Koeffizienten. Math. Z. 17, 228-249.
5. Klazar, M. (1992) A general upper bound in extremal theory of sequences. Comment. Math. Univ. Carolin. 33, 737-746.
6. Knuth, D. E. (1968) The art of computer programming. Addison-Wesley, Reading, MA.
7. Regev, A. (1981) Asymptotic values for degrees associated with strips of Young diagrams. Adv. Math. 41, 115-136.
8. Simion, R., and Schmidt, F. W. (1985) Restricted permutations. European J. of Combinatorics 6, 383-406.
9. Steele, J. M. (1997) Probability theory and combinatorial optimization. CBMS-NSF regional conference series in applied mathematics 69. SIAM, Philidelphia, PA.
10. West, J. (1990) Permutations with forbidden subsequences; and stack sortable permutations. Ph.D. Thesis, MIT.