Colored Motzkin paths of higher order

zbMATH Open1464.05149arXiv2012.14947MaRDI QIDQ4989360FDOQ4989360

Authors: Isaac Dejager, Madeleine Naquin, Frank Seidl, Paul Drube 

Publication date: 25 May 2021

Abstract: Motzkin paths of order-$ell$ are a generalization of Motzkin paths that use steps $U=(1,1)$, $L=(1,0)$, and $D_i=(1,-i)$ for every positive integer $ileqell$. We further generalize order-$ell$ 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 $k$-Dyck paths, including $k$-Dyck paths that remain weakly above horizontal lines $y=-a$, $k$-Dyck paths whose peaks all have the same height modulo-$k$, and Fuss-Catalan generalizations of Fine paths. A general bijection is also developed between $$-colored Motzkin paths and certain subclasses of $k$-ary trees.

Full work available at URL: https://arxiv.org/abs/2012.14947

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Counting peaks and valleys in \(k\)-colored Motzkin paths
• Motzkin paths with a restricted first return decomposition
• Dyck paths with coloured ascents
• From \((2,3)\)-Motzkin paths to Schröder paths
• scientific article; zbMATH DE number 6830801

zbMATH Keywords

lattice pathRiordan arrayMotzkin number\(k\)-ary treefine number

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• A Catalan triangle
• Catalan, Motzkin, and Riordan numbers
• Enumeration via ballot numbers
• Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
• On Some Alternative Characterizations of Riordan Arrays
• Combinatorial aspects of continued fractions
• Basic analytic combinatorics of directed lattice paths
• Pascal triangles, Catalan numbers and renewal arrays
• Catalan Numbers
• Catalan numbers, their generalization, and their uses
• Motzkin numbers
• Motzkin numbers
• Staircase tilings and \(k\)-Catalan structures
• Counting peaks and valleys in \(k\)-colored Motzkin paths
• Title not available (Why is that?)
• Motzkin numbers of higher rank: Generating function and explicit expression
• A survey of the Fine numbers
• A relation between restricted and unrestricted weighted Motzkin paths
• Title not available (Why is that?)
• Fuss-Catalan matrices, their weighted sums, and stabilizer subgroups of the Riordan group

Cited In (6)

• A bijection for some paths on the slit plane
• Dyck paths with coloured ascents
• Title not available (Why is that?)
• Counting peaks and valleys in \(k\)-colored Motzkin paths
• The relevant prefixes of coloured Motzkin walks: an average case analysis
• Title not available (Why is that?)

Uses Software

• OEIS

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)