Counting peaks and valleys in \(k\)-colored Motzkin paths
The electronic journal of combinatorics, Tome 12 (2005)
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.
@article{10_37236_1913,
author = {A. Sapounakis and P. Tsikouras},
title = {Counting peaks and valleys in \(k\)-colored {Motzkin} paths},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1913},
zbl = {1060.05009},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1913/}
}
A. Sapounakis; P. Tsikouras. Counting peaks and valleys in \(k\)-colored Motzkin paths. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1913
Cité par Sources :