The uvu\mathbf{uvu}-avoiding (a,b,c)(a,b,c)-Generalized Motzkin paths with vertical steps: bijections and statistic enumerations

preprint2022arXivOpen access

Abstract

A generalized Motzkin path, called G-Motzkin path for short, of length nn is a lattice path from (0,0)(0, 0) to (n,0)(n, 0) in the first quadrant of the XOY-plane that consists 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). An (a,b,c)(a,b,c)-G-Motzkin path is a weighted G-Motzkin path such that the u\mathbf{u}-steps, h\mathbf{h}-steps, v\mathbf{v}-steps and d\mathbf{d}-steps are weighted respectively by 1,a,b1, a, b and cc. In this paper, we first give bijections between the set of uvu\mathbf{uvu}-avoiding (a,b,b2)(a,b,b^2)-G-Motzkin paths of length nn and the set of (a,b)(a,b)-Schröder paths as well as the set of (a+b,b)(a+b,b)-Dyck paths of length 2n2n, between the set of {uvu,uu}\{\mathbf{uvu, uu}\}-avoiding (a,b,b2)(a,b,b^2)-G-Motzkin paths of length nn and the set of (a+b,ab)(a+b,ab)-Motzkin paths of length nn, between the set of {uvu,uu}\{\mathbf{uvu,uu}\}-avoiding (a,b,b2)(a,b,b^2)-G-Motzkin paths of length n+1n+1 beginning with an h\mathbf{h}-step weighted by aa and the set of (a,b)(a,b)-Dyck paths of length 2n+22n+2. In the last section, we focus on the enumeration of statistics "number of z\mathbf{z}-steps" for z∈{u,h,v,d}\mathbf{z}\in \{\mathbf{u}, \mathbf{h}, \mathbf{v}, \mathbf{d}\} and "number of points" at given level in uvu\mathbf{uvu}-avoiding G-Motzkin paths. These counting results are linked with Riordan arrays.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.