Permutations avoiding an increasing number of length-increasing forbidden subsequences

Discrete Mathematics and Theoretical Computer Science

Volumn 4, Issue 1, 2000, Pages 31-44

  Barcucci, Elena ^a   Del Lungo, Alberto ^a   Pergola, Elisa ^a   Pinzani, Renzo ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Catalan numbers; Forbidden subsequences; Permutations; Schr der numbers

Indexed keywords

EID: 0002540288     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. 1 are Wilf equivalent, Graph and Combinatorics (to appear).
2. th FPSAC (Barcelona) (1999).
3. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, From Motzkin to Catalan permutations, Discrete Mathematics (to appear).
4. J. Berstel, Axel Thue's papers on repetitions in words: translation, Publication du LaCIM 19 (1994).
5. M. Bóna, Permutations avoiding certain patterns. The case of length 4 and some generalizations, Discrete Mathematics, 175 (1997) 55-67.
6. M. Bóna, Exact enumeration of 1342-avoiding permutations; a close link with labelled trees and planar maps, Journal of Combinatorial Theory, Ser A, 80 (1997) 257-272.
7. M. Bona, Permutations with one or two 132-sequences, Discrete Mathematics, 181 (1998) 267-274.
8. P. Bose, J.F. Buss, A. Lubiw, Pattern matching for permutations, Lecture Notes in Computer Science, 709 (1993) 200-209.
9. M. Bousquet-Mélou, A method for the enumeration of various classes of column-convex polygons, Discrete Mathematics, 154 (1996) 1-25.
10. M. Bousquet-Mélou, Multi-statistic enumeration of two-stack sortable permutations, Electronic Journal of Combinatorics, 5 (1998) #R21.
11. T. Chow, J. West, Forbidden subsequences and Chebyshev polynomials, Discrete Mathematics, 204 (1999) 119-128.
12. F.R.K. Chung, R.L. Graham, V.E. Hoggatt, M. Kleiman, The number of Baxter permutations, Journal of Combinatorial Theory, Ser. A, 24 (1978) 382-394.
13. R. Cori, S. Dulucq, G. Viennot, Shuffle of parenthesis systems and Baxter permutations, Journal of Combinatorial Theory, Ser. A, 43 (1986) 1-22.
14. th FPSAC, Florence (1993) 165-178.
15. th FPSAC, Dimacs (1994) 119-128.
16. L. Euler, Institutiones calculi differentialis, in Opera Omnia, Series Prima, vol. X, Verlag von B.G. Teubner, Leipzig (1913).
17. I.M. Gessel, Symmetric functions and P-recursiveness, Journal of Combinatorial Theory, Ser. A, 53 (1990) 257-285.
18. S. Gire, Arbres, permutations a motifs exclus et cartes planaires: quelques problemes algorithmiques et combinatoires, Thèse de l'Université de Bordeaux I (1993).
19. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, Addison-Wesley Pub. Co., Reading, Massachusetts (1989).
20. O. Guibert, Combinatoires des permutations a motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Thèse de l'Université de Bordeaux I (1996).
21. I. P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, Journal of Combinatorial Theory, Ser. A (to appear).
22. D.E. Knuth, The art of computer programming, vol. 3, Addison-Wesley, Reading, MA (1973).
23. M. Lothaire, Combinatorics and words, G.C. Rota editor, Encyclopedia of Mathematics and its Applications 17, Addison-Wesley, Reading, MA (1983).
24. P.A. Macmahon, Combinatory Analysis, vols. 1 and 2, Cambridge Univ. Press, Cambridge (1915) reprinted by Chelsea, New York (1955).
25. 4 (preprint 1999) math.CO/9909019.
26. T. Mansour, Permutations containing and avoiding certain patterns (preprint 1999) math.CO/9911243.
27. T. Mansour and A. Vainshtein, Restricted permutations, continued fractions, and Chebyshev polynomials (preprint 1999) math.CO/9912052.
28. John Noonan, The number of permutations containing exactly one increasing subsequence of length three, Discrete Mathematics, 152 (1996) 307-313.
29. th FPSAC, Barcelona (1999).
30. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Advances in Mathematics, 41 (1981) 115-136.
31. A. Robertson, Permutations Containing and Avoiding 123 and 132 Patterns, Discrete Mathematics and Theoretical Computer Science, 3 (1999) 151-154.
32. A. Robertson, H. Wilf and D. Zeilberger, Permutation Patterns and Continued Fractions, The Electronic Journal of Combinatorics 6 (1999).
33. D. Rotem, Stack sortable permutations, Discrete Mathematics, 33 (1981) 185-196.
34. R. Simion, F.W. Schmidt, Restricted permutations, European Journal of Combinatorics, 6 (1985) 383-406.
35. Z. Stankova, Forbidden Subsequences, Discrete Mathematics, 132 (1994) 291-316.
36. J. West, Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, M.I.T., Cambridge, MA (1990).
37. J. West, Sorting twice through a stack, Theoretical Computer Science, 117 (1993) 303-313.
38. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Mathematics, 146 (1995) 247-262.
39. J. West, Generating trees and forbidden subsequences, Discrete Mathematics, 157 (1996) 363-374.