From Motzkin to Catalan permutations

Discrete Mathematics

Volumn 217, Issue 1-3, 2000, Pages 33-49

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

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002960996     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00254-X     Document Type: Article

References (27)

1. E. Barcucci, A. Del Lungo, S Lanini, M. Macri, R. Pinzani, The inversion number of some permutations with forbidden subsequences, Proceedings of SOCA'96, Tianjin, 1996, pp. 21-32.
2. E. Barcucci, A. Del Lungo, S. Fezzi, R. Pinzani, Non-decreasing Dyck paths and q-Fibonacci numbers, Discrete Math. 170 (1997) 211-217.
3. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A construction for enumerating k-coloured Motzkin paths, Lecture Notes in Computer Science, Vol. 959, 1995, pp. 254-263.
4. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A methodology for plane tree enumeration, Discrete Math. 180 (1998) 45-64.
5. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Directed animals, forest of trees and permutations, Discrete Math. 204 (1999) 41-71.
6. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, ECO: a methodology for the enumeration of combinatorial objects, J. Difference Equations Appl., to appear.
7. J. Berstel, Axel Thue's papers on repetitions in words: translation, Publication du LaCIM 19 (1994).
8. P. Bose, J.F. Buss, A. Lubiw, Pattern matching for permutations, Lect. Notes Comput. Sci., Vol. 709, 1993, 200-209.
9. M. Bousquet-Mélou, A method for the enumeration of various classes of column-convex polygons, Discrete Math. 154 (1996) 1-25.
10. R. Cori, S. Dulucq, G. Viennot, Shuffle of parenthesis systems and Baxter permutations, J. Combin. Theory A 43 (1986) 1-22.
11. S. Dulucq, S. Gire, J. West, Permutations à motifs exclus et cartes planaires non séparables, Proceedings of fifth FPSAC, Florence, 1993, pp. 165-178.
12. S. Dulucq, O. Guibert, Mots de piles, tableaux standards et permutations de Baxter, Proceedings of sixth FPSAC, Dimacs, 1994, pp. 119-128.
13. I.M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory A 53 (1990) 257-285.
14. S. Gire, Arbres, permutations à motifs exclus et cartes planaires: quelques problèmes algorithmiques et combinatoires, Thèse de l'Université de Bordeaux I, 1993.
15. O. Guibert, Combinatoires des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Thèse de l'Université de Bordeaux I, 1996.
16. I.P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, J. Combin. Theory A 75 (1996) 220-242.
17. D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1973.
18. M. Lothaire, Combinatorics on words, in: G.C. Rota (Ed.), Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, MA, 1983.
19. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. in Math. 41 (1981) 115-136.
20. D. Rotem, Stack sortable permutations, Discrete Math. 33 (1981) 185-196.
21. R. Simion, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
22. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Accademic Press, San Diego, 1995.
23. J. West, Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, MIT., Cambridge, MA, 1990.
24. J. West, Sorting twice through a stack, Theoret. Comput. Sci. 117 (1993) 303-313.
25. J. West, Generating trees and forbidden subsequences, Proceedings of sixth FPSAC, Dimacs (1994) 441-450.
26. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
27. B. Zeilberger, A proof of Julian West's conjecture that the number of two stack sortable permutations of length n is 2(3n)!/(n+1)!(2n+1)!, Discrete Math. 102 (1992) 85-93.