Nondecreasing Dyck paths and q-fibonacci numbers

Discrete Mathematics

Volumn 170, Issue 1-3, 1997, Pages 211-217

  Barcucci, E ^a   Del Lungo, A ^a   Fezzi, S ^a   Pinzani, R ^a  

^a Dipartimento di Sistemi e Informatica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043016621     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)82778-1     Document Type: Article

References (7)

1. E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, Towards a methodology for tree enumeration, in: B. Leclerc and J.Y. Thibon, eds., Proceedings 7th FPSAC7, Université de Marne-la-Vallé (1995).
2. E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, A construction for enumerating k-coloured Motzkin paths, in: Lecture Notes in Computers Science 959 (Springer, Berlin, 1995) 254-263.
3. L. Carlitz, Sequences, paths, ballot numbers, Fibonacci Quart. 10 (1972) 531-549.
4. M. Delest and J.M. Fédou, Enumeration of skew Ferrer diagrams, Discrete Math. 112 (1993) 65-79.
5. M. Delest and X.G. Viennot, Algebraic languages and polyominoes enumeration, Theoret. Comput. Sci. 34 (1984) 169-206.
6. I. Dutour and J.M. Fédou, Grammaires d'objets, rapport Labri 383-394, Université Bordeaux I, Bordeaux (1994).
7. J. Furlinger and J. Hofbauer, q-Catalan numbers, J. Combin. Theory Ser. A. 40 (1985) 248-264.