The uvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations

被引:0
|
作者
Sun, Yidong [1 ]
Wang, Weichen [1 ]
Sun, Cheng [1 ]
机构
[1] Dalian Maritime Univ, Sch Sci, Dalian 116026, Peoples R China
关键词
G-Motzkin path; (a; b)-Dyck path; b)-Motzkin path; b)-Schroder path; Riordan array; SCHRODER NUMBERS; LATTICE PATHS; RIORDAN; CATALAN; TREES;
D O I
10.1007/s00373-023-02706-z
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A generalized Motzkin path, called G-Motzkin path for short, of length n is a lattice path from (0, 0) to (n, 0) in the first quadrant of the XOY-plane that consists of up steps u = (1, 1), down steps d = (1, -1), horizontal steps h = (1, 0) and vertical steps v = (0, -1). An (a, b, c)-G-Motzkin path is a weighted G-Motzkin path such that the u-steps, h-steps, v-steps and d-steps are weighted respectively by 1, a, b and c. In this paper, we first give bijections between the set of uvu-avoiding (a, b, b(2))-G-Motzkin paths of length n and the set of (a, b)-Schroder paths as well as the set of (a + b, b)-Dyck paths of length 2n, between the set of {uvu, uu}-avoiding (a, b, b(2))- G-Motzkin paths of length n and the set of (a + b, ab)-Motzkin paths of length n, between the set of {uvu, uu}-avoiding (a, b, b(2))-G-Motzkin paths of length n + 1 beginning with an h-step weighted by a and the set of (a, b)-Dyck paths of length 2n+2. In the last section, we focus on the enumeration of statistics "number of z-steps" for z ? {u, h, v, d} and "number of points" at given level in uvu-avoiding G-Motzkin paths. These counting results are linked with Riordan arrays.
引用
收藏
页数:23
相关论文
共 6 条