Counting peaks and valleys in $k$-colored Motzkin paths

Abstract

This paper deals with the enumeration of $k$-colored Motzkin paths with a fixed number of (left and right) peaks and valleys. Further enumeration results are obtained when peaks and valleys are counted at low and high level. Many well-known results for Dyck paths are obtained as special cases.