Counting humps in Motzkin paths
Counting humps in Motzkin paths
复制标题
计算 Motzkin 路径中的驼峰
DOI:
10.1016/j.dam.2011.08.018
复制
发表时间:
2011-09
影响因子:
1.1
通讯作者:
Du, Rosena R. X.
中科院分区:
文献类型:
--
作者:
Ding, Yun;Du, Rosena R. X.
In this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Recently A. Regev noticed that the number of peaks in all Dyck paths of order n is one half of the number of super-Dyck paths of order n. 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 n with k peaks is the Narayana number. By double counting super-Schröder paths, we also get an identity involving products of binomial coefficients.
登录
查看更多内容
影响因子:
0.5
作者:
T. Mansour
通讯作者:
T. Mansour
DOI:
--
发表时间:
2001-05
期刊:
--
影响因子:
--
作者:
Paul Peart;Wen-Jin Woan
通讯作者:
Paul Peart;Wen-Jin Woan
DOI:
--
发表时间:
2011-12
期刊:
--
影响因子:
--
作者:
R. Stanley
通讯作者:
R. Stanley
DOI:
--
发表时间:
2010-02
期刊:
arXiv: Combinatorics
影响因子:
--
作者:
A. Regev
通讯作者:
A. Regev
DOI:
--
发表时间:
2002-03
期刊:
arXiv: Combinatorics
影响因子:
--
作者:
T. Mansour
通讯作者:
T. Mansour