English

Some statistics on generalized Motzkin paths with vertical steps

Combinatorics 2022-01-25 v1

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 (0,0)(0, 0) to (n,0)(n, 0) in the first quadrant of the XOYXOY-plane that consist of up steps u=(1,1)\mathbf{u}=(1, 1), down steps d=(1,1)\mathbf{d}=(1, -1), horizontal steps h=(1,0)\mathbf{h}=(1, 0) and vertical steps v=(0,1)\mathbf{v}=(0, -1). We mainly count the number of G-Motzkin paths of length nn with given number of z\mathbf{z}-steps for z{u,h,v,d}\mathbf{z}\in \{\mathbf{u}, \mathbf{h}, \mathbf{v}, \mathbf{d}\}, and enumerate the statistics "number of z\mathbf{z}-steps" at given level in G-Motzkin paths for z{u,h,v,d}\mathbf{z}\in \{\mathbf{u}, \mathbf{h}, \mathbf{v}, \mathbf{d}\}, some explicit formulas and combinatorial identities are given by bijective and algebraic methods, some enumerative results are linked with Riordan arrays according to the structure decompositions of G-Motzkin paths. We also discuss the statistics "number of z1z2\mathbf{z}_1\mathbf{z}_2-steps" in G-Motzkin paths for z1,z2{u,h,v,d}\mathbf{z}_1, \mathbf{z}_2\in \{\mathbf{u}, \mathbf{h}, \mathbf{v}, \mathbf{d}\}, the exact counting formulas except for z1z2=dd\mathbf{z}_1\mathbf{z}_2=\mathbf{dd} are obtained by the Lagrange inversion formula and their generating functions.

Keywords

Cite

@article{arxiv.2201.09231,
  title  = {Some statistics on generalized Motzkin paths with vertical steps},
  author = {Yidong Sun and Di Zhao and Wenle Shi and Weichen Wang},
  journal= {arXiv preprint arXiv:2201.09231},
  year   = {2022}
}

Comments

37 pages, 3 figures

R2 v1 2026-06-24T08:59:01.434Z