Advertisement

A construction for enumerating k-coloured Motzkin paths

  • Elena Barcucci
  • Alberto Del Lungo
  • Elisa Pergola
  • Renzo Pinzani
Session 4B: Combinatorics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

We illustrate a method for enumerating k- coloured Motzkin paths according to various parameters and, we give a recursive description of these paths from which we deduce the k- coloured Motzkin paths' generating function according to their length, area and last fall length.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: Towards a methodology for tree enumeration. Proc. of the 7th FPSAC, Marne-la-Vallée, 1995 (to appear)Google Scholar
  2. 2.
    Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Report LaBRI 378–93, Université Bordeaux I (1993).Google Scholar
  3. 3.
    Flajolet P.: Combinatorial aspects of continued fractions. Discrete Mathematics 32 (1980) 125–161.Google Scholar
  4. 4.
    Donaghey, R., Shapiro, L.: Motzkin numbers. J. Combin. Theory, A 23 (1977) 291–301.CrossRefGoogle Scholar
  5. 5.
    Goulden, I. P., Jackson, D. M.: Combinatorial enumeration. John Wiley and Sons, New York (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Elena Barcucci
    • 1
  • Alberto Del Lungo
    • 1
  • Elisa Pergola
    • 1
  • Renzo Pinzani
    • 1
  1. 1.Dipartimento di Sistemi e InformaticaFirenzeItaly

Personalised recommendations