Counting peaks and valleys in \(k\)-colored Motzkin paths (Q1773208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Aristidis Sapounakis / rank
Normal rank
 
Property / author
 
Property / author: Panagiotis Tsikouras / rank
Normal rank
 

Revision as of 22:34, 14 February 2024

scientific article
Language Label Description Also known as
English
Counting peaks and valleys in \(k\)-colored Motzkin paths
scientific article

    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

    Identifiers