vix.ing · top · new · best · stats · spec

Weighted 2-Motzkin Paths

2004/10/07 by William Y. C. Chen, Chen, William Y. C., Sherry H. F. Yan +3
Mathematics · #05A15 #05A19 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A15 #msc:05A19

paper · pdf · doi:10.48550/arxiv.math/0410200

6 pages

arxiv created 2004/10/07 · arxiv updated 2009/12/01

Abstract

This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch and Elizalde can be used to provide combinatorial interpretations of the identities of Coker when it is applied to weighted plane trees. For the sake of presentation of our combinatorial correspondences, we provide a description of the bijection of Chen, Deutsch and Elizalde in a slightly different manner in the form of a direct construction from plane trees to 2-Motzkin paths without the intermediate step involving the Dyck paths.

Related