The patterns of permutations

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 575-583

  Wilf, Herbert S ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Pattern avoidance; Patterns; Permutations; Stanley wilf conjecture

Indexed keywords

EID: 31244433179     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00515-0     Document Type: Article

References (27)

1. N. Alon, E. Friedgut, On the number of permutations avoiding a given pattern, J. Combin. Theory Ser. A 89 (2000) 133-140.
2. R. Arratia, On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern, Electron. Combin. 6 (1999) N1.
3. M. Bóna, The number of permutations with exactly r 132-subsequenccs is P-recursive in the size! Adv. Appl. Math. 18 (1997) 510-522.
4. M. Bóna, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Combin. Theory Ser. A 80 (1997) 257-272.
5. M. Bóna, Permutations avoiding certain patterns: the case of length 4 and generalizations. Discrete Math. 175 (1997) 55-67.
6. M. Bóna, The permutation classes equinumerous to the smooth class, Electron. J. Combin. 5 (1998) R31.
7. M. Bóna, Permutations with one or two 132-subsequences. Discrete Math. 181 (1998) 267-274.
8. M. Bóna, The solution of a conjecture of Wilf and Stanley for all layered patterns, J. Combin. Theory Ser. A 85 (1999) 96-104.
9. Alex Burstein, Enumeration of words with forbidden patterns, Ph.D. Dissertation, University of Pennsylvania, 1998.
10. S. Dulucq, S. Gire, J. West, Permutations with forbidden subsequences and nonseparable planar maps, Proceedings of the Fifth Conference on Formal Power Series and Algebraic Combinatorics, Discrete Math. 153 (1-3) (1996) 85-103.
11. I.M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A 53 (1990) 257-285.
12. d and permutations with no long ascending subsequences, Electron. J. Combin. 5 (1998) R2.
13. I.P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, J. Combin. Theory Ser. A 75 (2) (1996) 220-242.
14. M. Klazar, A general upper bound in extremal theory of sequences, Comment. Math. Univ. Carolin. 33 (1992) 737-747.
15. M. Klazar, P. Valtr, Generalized Davenport-Schinzel sequences, Combinatorica 14 (1994) 463-476.
16. J. Noonan, D. Zeilberger, The enumeration of permutations with a prescribed number of "forbidden" patterns, Adv. Appl. Math. 17 (1996) 381-407.
17. A. Price, Packing densities of layered patterns, Ph.D. Dissertation, University of Pennsylvania, 1997.
18. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math. 41 (1981) 115-136.
19. A. Robertson, H.S. Wilf, D. Zeilberger, Permutation patterns and continued fractions, Electron. J. Combin. 6 (1999) R38.
20. D. Rotem, Stack suitable permutations, Discrete Math. 33 (1981) 185-196.
21. R. Simon, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
22. Z.E. Stankova, Forbidden subsequences, Discrete Math. 132 (1-3) (1994) 291-316.
23. Z.E. Stankova, Classification of forbidden subsequences of length 4, European J. Combin. 17 (1996) 501-517.
24. W. Stromquist, Packing layered posets into posets, preprint, 1993.
25. R.E. Tarjan, Sorting using networks of queues and stacks, J. Assoc. Comput. Mach. 19 (1972) 341-346.
26. J. West, Generating trees and forbidden subsequences, Proceedings of the Sixth Conference on Formal Power Series and Algebraic Combinatorics, Discrete Math. 157 (1-3) (1996) 363-374.
27. H.S. Wilf, Ascending subsequences of permutations and the shapes of Young tableaux, J. Combin. Theory Ser. A 60 (1992) 155-157.