Motzkin Paths, Motzkin Polynomials and Recurrence Relations

We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers.  Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial "counting" all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials) have been studied before, but here we deduce some properties based on recurrence relations. The recurrence relations proved here also allow an efficient computation of the Motzkin polynomials. Finally, we show that the matrix entries of powers of an arbitrary tridiagonal matrix are essentially given by Motzkin polynomials, a property commonly known but usually stated without proof.

[1]  Emeric Deutsch,et al.  A bijection on Dyck paths and its consequences , 1998, Discret. Math..

[2]  Luca Guido Molinari,et al.  Enumeration of simple random walks and tridiagonal matrices , 2002 .

[3]  Alberto Del Lungo,et al.  A Construction for Enumerating k-coloured Motzkin Paths , 1995, COCOON.

[4]  J. Jeugt A Wigner distribution function for finite oscillator systems , 2013, 1310.3116.

[5]  Philippe Flajolet Combinatorial aspects of continued fractions , 1980, Discret. Math..

[6]  Robert A. Sulanke,et al.  Bijective Recurrences concerning Schro"der Paths , 1998, Electron. J. Comb..

[7]  R. Stanley Enumerative Combinatorics: Volume 1 , 2011 .

[8]  A. Regev Humps for Dyck and for Motzkin paths , 2010 .

[9]  Christian Krattenthaler,et al.  Permutations with Restricted Patterns and Dyck Paths , 2000, Adv. Appl. Math..

[10]  Gérard Viennot,et al.  A combinatorial theory for general orthogonal polynomials with extensions and applications , 1985 .

[11]  Robert Donaghey,et al.  Motzkin Numbers , 1977, J. Comb. Theory, Ser. A.

[12]  Emeric Deutsch,et al.  Dyck paths : generalities and terminology , 2003 .

[13]  Toufik Mansour,et al.  Bell polynomials and k-generalized Dyck paths , 2008, Discret. Appl. Math..

[14]  Emeric Deutsch,et al.  A bijection between ordered trees and 2-Motzkin paths and its many consequences , 2002, Discret. Math..

[15]  L. Comtet,et al.  Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .

[16]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[17]  Robert A. Sulanke Bijective Recurrences for Motzkin Paths , 2001, Adv. Appl. Math..

[18]  J. V. Jeugt,et al.  The Wigner distribution function for the $\mathfrak {su}(2)$ finite oscillator and Dyck paths , 2014, 1612.07686.

[19]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[20]  Renzo Pinzani,et al.  A Bijective Approach to the Area of Generalized Motzkin Paths , 2002, Adv. Appl. Math..

[21]  Sen-Peng Eu,et al.  Standard Young tableaux and colored Motzkin paths , 2013, J. Comb. Theory A.

[22]  T. Mansour Counting peaks at height k in a Dyck path , 2002, math/0203222.

[23]  The Wigner distribution function for the su ( 2 ) finite oscillator and Dyck paths , 2014 .

[24]  Rosena R. X. Du,et al.  Counting humps in Motzkin paths , 2012, Discret. Appl. Math..