arXiv Analytics

Sign in

arXiv:math/0410200 [math.CO]AbstractReferencesReviewsResources

Weighted 2-Motzkin Paths

William Y. C. Chen, Sherry H. F. Yan, Laura L. M. Yang

Published 2004-10-07Version 1

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 articles: Most relevant | Search more
arXiv:math/0611698 [math.CO] (Published 2006-11-22)
A bijection on Dyck paths and its cycle structure
arXiv:1705.05984 [math.CO] (Published 2017-05-17)
A bijection between bargraphs and Dyck paths
arXiv:1702.06150 [math.CO] (Published 2017-02-20)
Bijections for Dyck paths with all peak heights of the same parity