Colored Motzkin paths of higher order
From MaRDI portal
Publication:4989360
Abstract: Motzkin paths of order- are a generalization of Motzkin paths that use steps , , and for every positive integer . We further generalize order- Motzkin paths by allowing for various coloring schemes on the edges of our paths. These -colored Motzkin paths may be enumerated via proper Riordan arrays, mimicking the techniques of Aigner in his treatment of Catalan-like numbers. After an investigation of their associated Riordan arrays, we develop bijections between -colored Motzkin paths and a variety of well-studied combinatorial objects. Specific coloring schemes allow us to place -colored Motzkin paths in bijection with different subclasses of generalized -Dyck paths, including -Dyck paths that remain weakly above horizontal lines , -Dyck paths whose peaks all have the same height modulo-, and Fuss-Catalan generalizations of Fine paths. A general bijection is also developed between -colored Motzkin paths and certain subclasses of -ary trees.
Recommendations
Cites work
- scientific article; zbMATH DE number 2186880 (Why is no real title available?)
- scientific article; zbMATH DE number 2186895 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- A Catalan triangle
- A relation between restricted and unrestricted weighted Motzkin paths
- A survey of the Fine numbers
- Basic analytic combinatorics of directed lattice paths
- Catalan Numbers
- Catalan numbers, their generalization, and their uses
- Catalan, Motzkin, and Riordan numbers
- Combinatorial aspects of continued fractions
- Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
- Counting peaks and valleys in \(k\)-colored Motzkin paths
- Enumeration via ballot numbers
- Fuss-Catalan matrices, their weighted sums, and stabilizer subgroups of the Riordan group
- Motzkin numbers
- Motzkin numbers
- Motzkin numbers of higher rank: Generating function and explicit expression
- On Some Alternative Characterizations of Riordan Arrays
- Pascal triangles, Catalan numbers and renewal arrays
- Staircase tilings and \(k\)-Catalan structures
Cited in
(11)- Dyck paths with coloured ascents
- Enumeration of \(k\)-Fibonacci paths using infinite weighted automata
- Counting peaks and valleys in \(k\)-colored Motzkin paths
- scientific article; zbMATH DE number 7666853 (Why is no real title available?)
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- The \(\mathfrak{uvu}\)-avoiding \((a, b, c)\)-generalized Motzkin paths with vertical steps: bijections and statistic enumerations
- A bijection for some paths on the slit plane
- Enumeration of the Motzkin paths above a line of rational slope
- scientific article; zbMATH DE number 2186880 (Why is no real title available?)
- Motzkin paths with a restricted first return decomposition
- A construction for enumerating k-coloured Motzkin paths
This page was built for publication: Colored Motzkin paths of higher order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989360)