Some statistics on generalized Motzkin paths with vertical steps
Yidong Sun, Di Zhao, Wenle Shi, Weichen Wang

TL;DR
This paper studies generalized Motzkin paths with vertical steps, providing explicit formulas, combinatorial identities, and connections to Riordan arrays for counting and analyzing various step statistics.
Contribution
It introduces G-Motzkin paths with vertical steps and derives new enumeration formulas, identities, and generating functions using bijective, algebraic, and Lagrange inversion methods.
Findings
Explicit formulas for G-Motzkin paths counts
Combinatorial identities linked with Riordan arrays
Enumeration of step statistics using algebraic methods
Abstract
Recently, several authors have considered lattice paths with various steps, including vertical steps permitted. In this paper, we consider a kind of generalized Motzkin paths, called {\it G-Motzkin paths} for short, that is lattice paths from to in the first quadrant of the -plane that consist of up steps , down steps , horizontal steps and vertical steps . We mainly count the number of G-Motzkin paths of length with given number of -steps for , and enumerate the statistics "number of -steps" at given level in G-Motzkin paths for , some explicit formulas and combinatorial identities are given by bijective and algebraic methods,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Bayesian Methods and Mixture Models · Markov Chains and Monte Carlo Methods
