81 research outputs found
Riordan Paths and Derangements
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We
establish a correspondence between Riordan paths and
-avoiding derangements. We also present a combinatorial proof
of a recurrence relation for the Riordan numbers in the spirit of the
Foata-Zeilberger proof of a recurrence relation on the Schr\"oder numbers.Comment: 9 pages, 2 figure
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 sonic 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
- …