Counting Humps in Motzkin paths
Combinatorics
2011-09-14 v1
Abstract
In this paper we study the number of humps (peaks) in Dyck, Motzkin and Schr\"{o}der paths. Recently A. Regev noticed that the number of peaks in all Dyck paths of order is one half of the number of super Dyck paths of order . He also computed the number of humps in Motzkin paths and found a similar relation, and asked for bijective proofs. We give a bijection and prove these results. Using this bijection we also give a new proof that the number of Dyck paths of order with peaks is the Narayana number. By double counting super Schr\"{o}der paths, we also get an identity involving products of binomial coefficients.
Keywords
Cite
@article{arxiv.1109.2661,
title = {Counting Humps in Motzkin paths},
author = {Yun Ding and Rosena R. X. Du},
journal= {arXiv preprint arXiv:1109.2661},
year = {2011}
}
Comments
8 pages, 2 Figures