Counting peaks and valleys in \(k\)-colored Motzkin paths

zbMath1060.05009MaRDI QIDQ1773208

Aristidis Sapounakis, Panagiotis Tsikouras

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124414

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (11)

Skew Motzkin paths ⋮ Colored Motzkin Paths of Higher Order ⋮ Some matrix identities on colored Motzkin paths ⋮ The height of two types of generalised Motzkin paths ⋮ Enumerating Hamiltonian cycles ⋮ Pattern avoiding partitions and Motzkin left factors ⋮ Enumeration of Łukasiewicz paths modulo some patterns ⋮ Counting strings in Dyck paths ⋮ A history and a survey of lattice path enumeration ⋮ Pattern distributions in Dyck paths with a first return decomposition constrained by height ⋮ Unnamed Item

This page was built for publication: Counting peaks and valleys in \(k\)-colored Motzkin paths