Counting Humps in Motzkin paths
Abstract
In this paper we study the number of humps (peaks) in Dyck, Motzkin and Schr\"oder 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\"oder paths, we also get an identity involving products of binomial coefficients.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.