Counting Humps in Motzkin paths

preprint2011arXivOpen access

Abstract

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 nn is one half of the number of super Dyck paths of order nn. 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 nn with kk peaks is the Narayana number. By double counting super Schröder paths, we also get an identity involving products of binomial coefficients.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.