Counting peaks and valleys in \(k\)-colored Motzkin paths (Q1773208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting peaks and valleys in k-colored Motzkin paths |
scientific article; zbMATH DE number 2161317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting peaks and valleys in \(k\)-colored Motzkin paths |
scientific article; zbMATH DE number 2161317 |
Statements
Counting peaks and valleys in \(k\)-colored Motzkin paths (English)
0 references
25 April 2005
0 references
Summary: 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.
0 references
0.8225271105766296
0 references
0.7895075678825378
0 references
0.7838078141212463
0 references
0.7759712934494019
0 references
