Promotion of Lattice Paths by Riordan Arrays

Abstract

This paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion. We demonstrate how Dyck paths can be promoted to generalised Motzkin and Schröder paths via two key transformations: the Binomial and Chebyshev transforms, each associated with specific Riordan arrays. These promotions yield classical integer sequences and continued fraction representations that enumerate weighted lattice paths. The framework is further extended to analyse grand paths, which are permitted to cross below the x-axis. We develop constructive bijections establishing explicit correspondences between promoted path families. The promotion framework offers new insights into known integer sequences and enables a unified approach to the generalisation and classification of lattice paths.

1. Introduction

Riordan arrays and lattice paths provide a unifying framework for studying and counting combinatorial structures. Riordan arrays, formally introduced in 1991 by Shapiro et al., are infinite, lower-triangular matrices defined by pairs of generating functions, originally used to generalise properties of Pascal’s triangle [1]. Lattice paths have played a central role in combinatorics since the 1960’s [2], where they have been approached through analytical techniques (e.g., the kernel method), probabilistic methods, and algebraic tools such as Riordan arrays, where many connections have been established. Here the aim is to further deepen these connections by using Riordan array theory to enable the enumeration of broader path families, particularly focusing on the framework of promotion. In this paper, the term promotion refers to the action of a Riordan array on lattice paths, whereby the array systematically alters the step set and weights of the paths. This approach provides a structured way to derive new enumerative results and uncover hidden bijections between seemingly unrelated path families. A key tool in this study is the use of Riordan transforms, particularly the Binomial transform [3], which corresponds to the action of the Riordan array known as the Binomial matrix $\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)$ on a generating function. Similarly, we refer to the Riordan matrix $\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)$ as the Chebyshev transform. These transformations enable the systematic “promotion” of simple paths (e.g., Dyck paths) to more complex ones (e.g., Motzkin or Schröder paths), and they play a central role in the framework developed here.

The key contributions of this paper are as follows:

1.

Developing a generalised framework that extends classical paths to broader families using Riordan arrays.

2.

Deriving new enumerative results for these path families, including explicit generating functions and recurrence relations.

3.

Uncovering bijections between paths with different step sets and boundary conditions, revealing previously unnoticed combinatorial correspondences.

This expanded framework enriches our understanding of Riordan arrays and lattice paths. The promotion of simpler paths, such as Dyck paths, to Motzkin or Schröder paths via Riordan arrays is motivated by both theoretical and practical considerations. Riordan array transformations enable the derivation of new enumerative results. Practically, such paths appear in diverse areas such as coding theory, computational biology (e.g., RNA secondary structures) and, more recently, solutions to a variety of polymer models of absorption.

1.1. Preliminaries

1.1.1. Riordan Arrays

Riordan arrays [1,4,5] are defined by a pair of power series, drawn from two relevant subsets of the set of power series. These power series can be over a suitable ring that allows for the operations that are particular to the context of the problem at hand. In analytic contexts the coefficient ring is often taken as $\mathbb{C}$. In combinatorial settings, the ring of integers $\mathbb{Z}$ is often sufficient. Thus, we let

$${\mathcal{F}}_0=\{g\left(x\right)=g_0+g_{1}x+g_2{x}^2+\cdots |g_0\ne 0\}$$

be the set of power series with a non-zero constant term. Elements $g\left(x\right)\in {\mathcal{F}}_0$ are thus invertible, that is, we can talk about the reciprocal ${\displaystyle \frac{1}{g}}$. We also define

$${\mathcal{F}}_1=\{f\left(x\right)=f_{1}x+f_2{x}^2+\cdots |f_0=0, f_1\ne 0\}.$$

Elements $f\left(x\right)\in {\mathcal{F}}_1$ then possess a compositional inverse $\overline{f}\left(x\right)=f^{\langle -1\rangle }$, which satisfies $f\left(\overline{f}\left(x\right)\right)=x$ and $\overline{f}\left(f\left(x\right)\right)=x$. Thus $\overline{f}\left(x\right)$ is the solution $u\left(x\right)$ of the equation $f\left(u\right)=x$ that satisfies $u\left(0\right)=0$. Note that as a formal power series, $u\left(0\right)=0$ in this case just means that the constant term of the power series $u\left(x\right)$ is zero. Elements in ${\mathcal{F}}_1$ are composable. Thus, if $f\left(x\right)\in {\mathcal{F}}_1$, we can talk about the power series $g\left(f\right(x\left)\right)$. By a Riordan array, we mean a pair $(g\left(x\right), f\left(x\right))\in {\mathcal{F}}_0\times {\mathcal{F}}_1$. Each such pair has a matrix representation ${\left(t_{n,k}\right)}_{0\le n,k\le \infty }$ given by

$$t_{n,k}=\left[x^n\right]g\left(x\right)f{\left(x\right)}^k,$$

where $\left[x^n\right]$ is the functional that extracts the coefficient of $x^n$ in a power series. The set of Riordan arrays forms a group for the operations

$$\left(g\right(x), f(x\left)\right)·\left(u\right(x), v(x\left)\right)=\left(g\right(x\left)u\right(f\left(x\right)), v(f\left(x\right)\left)\right),$$

and

$${(g\left(x\right), f\left(x\right))}^{-1}=\left({\displaystyle \frac{1}{g\left(\overline{f}\left(x\right)\right)}}, \overline{f}\left(x\right)\right).$$

In the matrix representation, these expressions correspond to matrix multiplication and the matrix inverse. The identity element is $(1, x)$ since, with that, we have $t_{n,k}=\left[x^n\right]x^k={\delta }_{n,k}$.

As seen in the group product above, the operation of a Riordan array $\left(g\right(x), f(x\left)\right)$ on a power series $u\left(x\right)$ is given by

$$\left(g\right(x), f(x\left)\right)·u\left(x\right)=g\left(x\right)u\left(f\right(x\left)\right).$$

We call this the fundamental theorem of Riordan arrays. In the matrix representation, it corresponds to multiplying the vector whose elements are ${(u_0,u_1,u_2,\dots )}^T$ by the matrix $\left(t_{n,k}\right)$.

A subgroup of interest in this paper is the Bell subgroup. The Bell subgroup of the Riordan group is composed of elements of the form $\left(g\right(x), xg(x\left)\right)$.

Example 1. 

The Binomial matrix $\left(\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)\right)$ is given by the element of the Bell subgroup $\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)$ as

$$\begin{array}{cc}\hfill \left[x^n\right]{\displaystyle \frac{1}{1-x}}{\displaystyle \frac{x^k}{{(1-x)}^k}}& =\left[x^{n-k}\right]{\displaystyle \frac{1}{{(1-x)}^{k+1}}}\hfill \\ \hfill & =\left[x^{n-k}\right]\sum _{j=0}^{\infty }\left({\displaystyle \genfrac{}{}{0pt}{}{-k+1}{j}}\right){(-1)}^j{x}^j\hfill \\ \hfill & =\left[x^{n-k}\right]\sum _{j=0}^{\infty }\left({\displaystyle \genfrac{}{}{0pt}{}{k+1+j-1}{j}}\right)x^j\hfill \\ \hfill & =\left({\displaystyle \genfrac{}{}{0pt}{}{k+n-k}{n-k}}\right)\hfill \\ \hfill & =\left({\displaystyle \genfrac{}{}{0pt}{}{n}{n-k}}\right)=\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right).\hfill \end{array}$$

We refer to the effect of the Riordan array $\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)$ on a power series as the Binomial transform of the series. Note that ${\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)}^{\beta }=\left({\displaystyle \frac{1}{1-\beta x}},{\displaystyle \frac{x}{1-\beta x}}\right)$. A second element of interest of the Bell subgroup is $\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)$. We calculate that general term of the second array $\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)$. We obtain

$$\begin{array}{cc}\hfill t_{n,k}& =\left[x^n\right]{\displaystyle \frac{x^k}{{(1-x^2)}^{k+1}}}\hfill \\ \hfill & =\left[x^{n-k}\right]{(1-x^2)}^{-(k+1)}\hfill \\ \hfill & =\left[x^{n-k}\right]\sum _{j=0}^{\infty }\left({\displaystyle \genfrac{}{}{0pt}{}{-(k+1)}{j}}\right){(-1)}^j{x}^{2j}\hfill \\ \hfill & =\left[x^{n-k}\right]\sum _{j=0}^{\infty }\left({\displaystyle \genfrac{}{}{0pt}{}{k+j}{j}}\right)x^{2j}\hfill \\ \hfill & =\left({\displaystyle \genfrac{}{}{0pt}{}{k+\frac{n-k}{2}}{\frac{n-k}{2}}}\right){\displaystyle \frac{1+{(-1)}^{n-k}}{2}}\hfill \\ \hfill & =\left({\displaystyle \genfrac{}{}{0pt}{}{\frac{n+k}{2}}{k}}\right){\displaystyle \frac{1+{(-1)}^{n-k}}{2}}.\hfill \end{array}$$

Now this gives the matrix with first few entries

$$\left(\begin{array}{ccccccc}\left({\displaystyle \genfrac{}{}{0pt}{}{0}{0}}\right)& 0& 0& 0& 0& 0& 0\\ 0& \left({\displaystyle \genfrac{}{}{0pt}{}{1}{1}}\right)& 0& 0& 0& 0& 0\\ \left({\displaystyle \genfrac{}{}{0pt}{}{1}{0}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{2}{2}}\right)& 0& 0& 0& 0\\ 0& \left({\displaystyle \genfrac{}{}{0pt}{}{2}{1}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{3}{3}}\right)& 0& 0& 0\\ \left({\displaystyle \genfrac{}{}{0pt}{}{2}{0}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{3}{2}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{4}{4}}\right)& 0& 0\\ 0& \left({\displaystyle \genfrac{}{}{0pt}{}{3}{1}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{4}{3}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{5}{5}}\right)& 0\\ \left({\displaystyle \genfrac{}{}{0pt}{}{3}{0}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{4}{2}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{5}{4}}\right)& 0& \left({\displaystyle \genfrac{}{}{0pt}{}{6}{6}}\right)\end{array}\right).$$

We let $a\left(x\right)$ be the generating function of the sequence $a_0, a_1, a_2,\dots$. Then, the generating function

$$\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)·a\left(x\right)$$

expands to give the sequence $b_n$ with the general term

$$b_n=\sum _{k=0}^n\left({\displaystyle \genfrac{}{}{0pt}{}{\frac{n+k}{2}}{k}}\right){\displaystyle \frac{1+{(-1)}^{n-k}}{2}}{a}_k=\sum _{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n-k}{k}}\right)a_{n-2k}.$$

The Chebyshev polynomials of the second kind $U_n\left(x\right)$ can be expressed as $U_n\left(x\right)={\sum }_{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }{(-1)}^k\left({\displaystyle \genfrac{}{}{0pt}{}{n-k}{k}}\right){\left(2x\right)}^{n-2k}$. The coefficient structure in this expansion closely mirrors that generated by the Riordan array $\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right).$ For this reason, throughout this paper, we refer to the action of this array on a sequence as the Chebyshev transform, emphasising the connection with the combinatorial structure underlying the Chebyshev polynomials. Note that ${\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)}^{\gamma }=\left({\displaystyle \frac{1}{1-\gamma x^2}},{\displaystyle \frac{x}{1-\gamma x^2}}\right).$

1.1.2. Lattice Paths

In what follows are the definitions and notations that can be found in [6,7]. Meanwhile, known sequences of integers in this note will be referred to by their On-Line Encyclopedia of Integer Sequences (OEIS) numbers [8]. A step set $S\in {\mathbb{Z}}^2$ is a finite set of vectors $\{(a_1,b_1),\dots ,(a_m,b_m)\}$. An n-step lattice path or walk is a sequence of vectors $v=(v_1,\dots ,v_n)$ such that $v_j$ is in S. Geometrically, it is a set of points $\omega =({\omega }_0,{\omega }_1,\dots ,{\omega }_n)$, where ${\omega }_i\in {\mathbb{Z}}^2,{\omega }_0=(0, 0)$ and ${\omega }_i-{\omega }_{i-1}={\nu }_i$ for $i=1,\dots ,n$. The elements of S are called steps or jumps. The length $n=\left|\omega \right|$ of a lattice path is its number of jumps. Here we introduce the paths we will meet throughout this paper and present their enumerations using Riordan arrays. Motzkin paths with step set $S=\left\{\right(1, 1), (1, 0), (1,-1\left)\right\}$ that begin at $(0, 0)$, end at $(n, 0)$ and remain in the first quadrant are enumerated by the well known Motzkin numbers, $M_n$ (OEIS A001006), and satisfy the recurrence

$$M_n=M_{n-1}+\sum _{i=0}^{n-2}{M}_i{M}_{n-2-i},M_0=1,M_1=1.$$

The Motzkin numbers can also be expressed in closed form as $M_n={\sum }_{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n}{2k}}\right)C_k$, where $C_n={\displaystyle \frac{1}{n+1}}\left({\displaystyle \genfrac{}{}{0pt}{}{2n}{n}}\right)$ is the n-th Catalan number. This expression translates the fact that the Motzkin numbers are the Binomial transform of the aerated Catalan numbers (i.e., recall that the aerated sequence is formed by inserting a zero between each pair of Catalan numbers: $C_0, 0, C_1, 0, C_2, 0,\dots$). Now, using Riordan arrays, we can express the result as follows:

$$\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)·c\left(x^2\right)={\displaystyle \frac{1-x-\sqrt{1-2x-3x^2}}{2x^2}}=m\left(x\right),$$

which is the generating function of the Motzkin numbers, and $c\left(x\right)={\displaystyle \frac{1-\sqrt{1-4x}}{2x}}$ is the generating function of the Catalan numbers. Thus, the above binomial expression suggests that Dyck paths are “promoted” to full Motzkin paths by the Binomial matrix. Note that Dyck paths with step set $S=\left\{\right(1,-1),(1,1\left)\right\}$ that begin at $(0, 0)$, end at $(2n, 0)$ and remain in the first quadrant are enumerated by the Catalan numbers (OEIS A000108) and satisfy the recurrence

$$C_n=\sum _{i=0}^{n-1}{C}_i{C}_{n-i-1},C_0=1.$$

The Catalan numbers can also be expressed in closed form as $C_n={\displaystyle \frac{1}{n+1}}\left({\displaystyle \genfrac{}{}{0pt}{}{2n}{n}}\right).$

Motzkin paths with step set $S=\left\{\right(1, -1), (1, 0), (1, 1\left)\right\}$ that begin at $(0, 0)$, end at $(n, 0)$ and are not constrained to the first quadrant are known as grand Motzkin paths and are enumerated by the central trinomial numbers $T_n$ (OEIS A002426), with

$$T_n=\sum _{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n}{2k}}\right)\left({\displaystyle \genfrac{}{}{0pt}{}{2k}{k}}\right).$$

That is, $T_n$ is given by the Binomial transform of the aerated central binomial coefficients. In terms of generating functions and Riordan arrays, we have

$$\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)·{\displaystyle \frac{1}{\sqrt{1-4x^2}}}={\displaystyle \frac{1}{1-x}}{\displaystyle \frac{1}{\sqrt{1-4{\left(\frac{x}{1-x}\right)}^2}}}={\displaystyle \frac{1}{\sqrt{1-2x-3x^2}}}=t\left(x\right),$$

which is the generating function of the trinomial numbers. Note that Dyck paths with step set $S=\left\{\right(1, -1), (1, 1\left)\right\}$ that begin at $(0, 0)$, end at $(2n, 0)$ and do not have to remain in the first quadrant are enumerated by the aerated central binomial numbers and are known as grand Dyck paths, so, again, we have the notion of promotion by the Binomial matrix. Schröder paths with step set $S=\left\{\right(1, -1), (2, 0), (1, 1\left)\right\}$ that begin at $(0, 0)$, end at $(2n, 0)$ and remain in the first quadrant are enumerated by the large Schröder numbers (OEIS A006318) governed by the recurrence

$$S_n=3S_{n-1}+\sum _{i=1}^{n-2}{S}_i{S}_{n-i-1},S_0=1, S_1=2.$$

A closed form expression for the large Schröder numbers is $S_n={\sum }_{k=0}^n\left({\displaystyle \genfrac{}{}{0pt}{}{n+k}{2k}}\right)C_k$, where $C_k={\displaystyle \frac{1}{k+1}}\left({\displaystyle \genfrac{}{}{0pt}{}{2k}{k}}\right).$ Paths with step set $S=\left\{\right(1, -1), (1, 0), (2, 0), (1, 1\left)\right\}$ that begin at $(0, 0)$, end at $(2n, 0)$ and remain in the first quadrant are known as Motzkin–Schröder paths [9]. Note that these paths have also been referred to in the literature as 2-Motzkin paths, but this term has been also used to describe Motzkin paths with two types of horizontal $(1, 0)$ steps [10,11]. These paths have also been called 2-generalised Motzkin paths [12]. To avoid confusion, the term Motzkin–Schröder path is used in this paper. Removing the restriction to remain in the first quadrant gives grand Motzkin–Schröder paths. The notion of weighted Motzkin paths was first introduced by P. Flajolet in [13] and has been widely used in the literature related to Motzkin paths. In particular, the study of lattice path colourings is viewed as an assignment of weights on each step of a path; such a connection can be seen in some papers in enumerative and bijective combinatorics [9,11,14,15]. The following fundamental result shows the connection between weighted Motzkin paths and continued fractions.

Theorem 1 

([13,16]). Let

$${\mu }_n=\sum _{\pi \in {\mathcal{M}}_n}\nu \left(\pi \right)$$

where the sum is over the set ${\mathcal{M}}_n$ of Motzkin paths $\pi =\left(\pi \left(0\right),\dots ,\pi \left(n\right)\right)$ of length n. Here, $\pi \left(i\right)$ is the level after the $i^{\mathit{th}}$ step and the valuation of a path is the product of valuations of its steps $\nu \left(\pi \right)={\prod }_{i=1}^n{\nu }_i$, where

$${\nu }_i=\nu \left(\pi (i-1),\pi \left(i\right)\right)=\left\{\begin{array}{cc}1\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(1, 1),\hfill \\ {\beta }_{\pi (i-1)}\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(1, 0),\hfill \\ {\alpha }_{\pi (i-1)}\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(1, -1).\hfill \end{array}\right.$$

Then, the generating function

$$M\left(x\right)=\sum _{n=0}^{\infty }{\mu }_n{x}^n$$

has the Jacobi type continued fraction (J-fraction) expansion (see [17]).

$$M\left(x\right)={\displaystyle \frac{1}{1-{\beta }_{0}x-{\displaystyle \frac{{\alpha }_1{x}^2}{1-{\beta }_{1}x-{\displaystyle \frac{{\alpha }_2{x}^2}{1-{\beta }_{2}x-{\displaystyle \frac{{\alpha }_3{x}^2}{\dots }}}}}}}}.$$

(1)

Consequently, the above theorem can be extended to Schröder paths. The proof of this corollary follows from the symbolic method [18] applied to the step set $S=\left\{(1,1),(1,-1),(2,0)\right\}$.

Corollary 1. 

Suppose that

$${\sigma }_n=\sum _{\pi \in {\mathcal{S}}_n}\nu \left(\pi \right)$$

where ${\mathcal{S}}_n$ is the collection of Schröder paths $\pi =\left(\pi \left(0\right),\dots ,\pi \left(2n\right)\right)$ of semilength n and having the valuation $\nu \left(\pi \right)={\prod }_{i=1}^n{\nu }_i$, defined as follows:

$${\nu }_i=\nu \left(\pi (i-1),\pi \left(i\right)\right)=\left\{\begin{array}{cc}1\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(1, 1),\hfill \\ {\beta }_{\pi (i-1)}\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(2, 0),\hfill \\ {\alpha }_{\pi (i-1)}\hfill & \mathit{if}\mathit{the}{i}^{\mathit{th}}\mathit{step}\mathit{is}(1, -1).\hfill \end{array}\right.$$

Then, the generating function

$$S\left(x^2\right)=\sum _{n=0}^{\infty }{\sigma }_n{x}^{2n}$$

has the Thron type continued fraction (T-fraction) expansion.

$$S\left(x^2\right)={\displaystyle \frac{1}{1-{\beta }_0{x}^2-\frac{{\alpha }_1{x}^2}{1-{\beta }_1{x}^2-\frac{{\alpha }_2{x}^2}{1-{\beta }_2{x}^2-\frac{{\alpha }_3{x}^2}{\dots }}}}}.$$

(2)

In the generating function above, we can change $x^{2n}$ and $x^2$ into $x^n$ and x, respectively, without ill effect.

We end this section by introducing a result concerning coloured (or weighted) Motzkin–Schröder paths.

Proposition 1 

([9]). The number $A_n=A_n(r, s, t)$ of Motzkin–Schröder paths of length n, where the horizontal steps $h=(1, 0)$ can be of r colours, the horizontal steps $H=(2, 0)$ can be of s colours and the up steps $(1, 1)$ can be of t colours, is given by the following recurrence:

$$A_n=r{A}_{n-1}+s{A}_{n-2}+t\sum _{i=0}^{n-2}{A}_i{A}_{n-2-i},A_0=1, A_1=r.$$

(3)

2. Promotion of Lattice Paths

2.1. Promotion of a Family of Paths Restricted to the First Quadrant

We motivate this section first with the following example.

Example 2. 

The Motzkin–Schröder paths are enumerated by the sequence (OEIS A128720) which begins

$$1,1,3,6,16,40,109,297,836,\dots .$$

Expressing the related generating function using Riordan arrays, we have

$$\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)·m\left(x\right)={\displaystyle \frac{1-x-x^2-\sqrt{1-2x-5x^2+2x^3+x^4}}{2x^2}}.$$

The sequence OEIS A128720 has its general term given by ${\sum }_{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n-k}{k}}\right)M_{n-2k}$. From a path construction perspective, the Chebyshev transform is inducing the ‘Schröder’ step in the paths. The first few rows of the matrices expand as follows:

$$\left(\begin{array}{cccccc}1& 0& 0& 0& 0& 0\\ 0& 1& 0& 0& 0& 0\\ 1& 0& 1& 0& 0& 0\\ 0& 2& 0& 1& 0& 0\\ 1& 0& 3& 0& 1& 0\\ 0& 3& 0& 4& 0& 1\end{array}\right)\left(\begin{array}{c}1\\ 1\\ 2\\ 4\\ 9\\ 21\end{array}\right)=\left(\begin{array}{c}1\\ 1\\ 3\\ 6\\ 16\\ 40\end{array}\right).$$

We note that these paths can also be constructed from a double promotion of the aerated Catalan numbers as we have the following expression for the generating function.

$$\left({\displaystyle \frac{1}{1-x-x^2}},{\displaystyle \frac{x}{1-x-x^2}}\right)·c\left(x^2\right)=\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)·\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)·c\left(x^2\right).$$

Here we see two stages of promotion: Dyck paths to Motzkin, the promotion via the Binomial transform inducing a level step, and Motzkin to Motzkin–Schröder, the Chebyshev transform inducing a ‘Schröder’ step.

We introduced two promotion-based Riordan arrays above. In the following sections, we generalise these promotions to a broader class of generating functions and examine the resulting bijections between associated lattice path families.

2.1.1. Binomial Transform Promotions

The following proposition establishes the connection between promotion via the Binomial transform and generalised Motzkin paths.

Proposition 2. 

The ${\beta }^{th}$-Binomial transform of the generating function that enumerates Dyck paths with α-weighted $(1, -1)$ steps enumerates Motzkin paths with β-weighted $(1, 0)$ steps and α-weighted $(1, -1)$ steps.

Proof. 

The generating function for Dyck paths with $\alpha$-weighted $(1,-1)$ steps is ${\displaystyle \frac{1-\sqrt{1-4\alpha x^2}}{2\alpha x^2}}.$ Applying the ${\beta }^{th}$-Binomial transform gives

$$\left({\displaystyle \frac{1}{1-\beta x}},{\displaystyle \frac{x}{1-\beta x}}\right)·{\displaystyle \frac{1-\sqrt{1-4\alpha x^2}}{2\alpha x^2}}={\displaystyle \frac{1-\beta x-\sqrt{{(1-\beta x)}^2-4\alpha x^2}}{2\alpha x^2}}.$$

The Binomial transform adds $\beta$-weighted $(1, 0)$ steps, promoting Dyck paths to Motzkin paths. The generating function has continued fraction expansion.

$${\displaystyle \frac{1}{1-\beta x-\frac{\alpha x^2}{1-\beta x-\frac{\alpha x^2}{1-\beta x-\frac{\alpha x^2}{\ddots }}}}}.$$

(4)

□

The J-fraction in Theorem 1, Equation (1) has a well-known connection to lattice paths. The resulting sequences for various $\alpha$ and $\beta$ are listed below, with OEIS references where available.

Example 3. 

For $\alpha =1, \beta =1$ and $n=4$, the promotion construction is expanded below. The matrix shows the first few entries of the Binomial transform Riordan array $\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)$.

The $n^{th}$ entry of the vector ${(1, 0, 1, 0, 2\dots )}^T$ represents the number of Dyck paths of length n. These paths are promoted to Motzkin paths via the Binomial transform. The coloured lattice paths on the right illustrate the construction of the nine Motzkin paths of length 4 through the promotion of Dyck paths via the Binomial transform.

1. 

The one Dyck path of length 0 is promoted to Motzkin by adding four horizontal steps.

2. 

The one Dyck path of length 2 is promoted to Motzkin by adding two horizontal steps that are uniquely placed to make six distinct Motzkin paths.

3. 

The two Dyck paths of length 4 remain unchanged.

2.1.2. Bijections Arising from the Path Classifications in Table 1

We consider three types of walks confined to the first quadrant ${\mathbb{N}}^2$ of ${\mathbb{Z}}^2$, all starting at $(0, 0)$. In the case where $\alpha =2$ and $\beta =0$ in Table 1, the sequence expansion corresponds to the aerated Schröder numbers. In this subsection, we introduce three distinct families of lattice paths that are enumerated by this generating function. We then present explicit, constructive bijections between these path classes.

1.

Path 1: Starts at $(0, 0)$; ends on the y-axis. Step set: ${\mathcal{P}}_1=\{(1, 1),(-1, -1),(-1, 0)\}$. There are two choices $(-1, -1)$, $(-1, 0)$ for returning to the y-axis and one step $(1, 1)$ for leaving the y-axis.

2.

Path 2: Starts at $(0, 0)$; ends on the y-axis. Step set: ${\mathcal{P}}_2=\{(1, 1),(-1, 1),(1, 0)\}$. There are two steps $(1, 1)$, $(1, 0)$ for leaving the y-axis and one step $(-1, 1)$ for returning to the y-axis.

3.

Path 3: Starts at $(0, 0)$; ends on the x-axis. Step set: ${\mathcal{P}}_3=\{(1, 1), (1, -1)\}$. There are two coloured $(1, -1)$ steps for returning to the x-axis and one step $(1, 1)$ for leaving the x-axis.

Table 1. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (4).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,1,0,2,0,5,0,14,\dots$	A000108	Aerated (zeros between terms)
1	1	$1,1,2,4,9,21,51,127,\dots$	A001006
1	2	$1,2,5,14,42,132,429,\dots$	A000108	Excludes the initial term $a_0=1$
2	0	$1,0,2,0,8,0,40,0,224,\dots$	A151374	Aerated
2	1	$1,1,3,7,21,61,191,\dots$	A025235
2	2	$1,2,6,20,72,272,1064,\dots$	A071356

Table 1. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (4).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,1,0,2,0,5,0,14,\dots$	A000108	Aerated (zeros between terms)
1	1	$1,1,2,4,9,21,51,127,\dots$	A001006
1	2	$1,2,5,14,42,132,429,\dots$	A000108	Excludes the initial term $a_0=1$
2	0	$1,0,2,0,8,0,40,0,224,\dots$	A151374	Aerated
2	1	$1,1,3,7,21,61,191,\dots$	A025235
2	2	$1,2,6,20,72,272,1064,\dots$	A071356

Each path satisfies the generating function recurrence

$$A\left(x\right)=1+2x{A\left(x\right)}^2.$$

The factor of 2 arises from the number of symmetric choices in departing from or returning to the axis in each type of walk, as detailed in the path set steps above. Solving this quadratic gives the generating function:

$$A\left(x\right)={\displaystyle \frac{1-\sqrt{1-8x}}{4x}}.$$

Note that paths 1 and 3 are referenced in the OEIS A151374 and path 2 is studied in [19]. A constructive bijection between the three path classes is presented in the next section. Before proceeding, we illustrate each of the path types with an example of length $n=4$.

Example 4. 

For $n=4$, the eight paths for paths 1, 2 and 3 as defined above are drawn below.

2.1.3. Constructive Bijection Between Paths 1, 2 and 3

We define a bijection between paths 1 and 2 by reinterpreting their step types as follows.

• In path 1 the steps are defined as $D=(1,1)$, $D_L=(-1,-1)$ and $H_L=(-1,0)$.
• In path 2 the steps are defined as $D=(1,1)$, $L=(-1,1)$ and $H=(1,0)$.

The mapping between these step types defines the bijection. Bijective steps are shown below, accompanied by an illustrative example for $n=4$.

We also define a bijection between paths 1 and 3, again by reinterpreting their step types as follows:

• In path 1 the steps are defined as $D=(1,1)$, $D_L=(-1,-1)$ and $H_L=(-1,0)$.
• In Path 3 the steps are defined as $D=(1,1),D_A=(-1,1)$ and $D_B=(-1,1)$, where $D_A$ and $D_B$ are two differently coloured steps representing a weighting of 2.

Once again, the mapping between these step types defines the bijection. Bijective steps are again shown below, accompanied by an illustrative example for $n=4$.

Both substitutions preserve the overall step count and establish a one-to-one correspondence, mapping Path 1 to Path 2 and Path 1 to Path 3. To complete the triangle of bijections, we leave it to the reader to construct an analogous bijection between Paths 2 and 3.

2.1.4. Promotion and Extended Bijections

The notion of promotion can be now applied to the bijective framework as described above to extend the step set of paths 1, 2 and 3.

Under the Binomial transform promotion, paths 1 and 2 are extended by the inclusion of a vertical step. The resulting promoted step sets are

1.

Path 1: $\left\{(1,1),(-1,-1),(-1,0),(0,1)\right\}$;

2.

Path 2: $\left\{(1,1),(-1,1),(1,0),(0,1)\right\}$.

This now yields a bijection between the promoted path 1 and path 2 families and the family of Motzkin paths featuring two types of weighted steps. The explicit construction of this bijection is omitted, as it follows naturally from the earlier bijections. We now generalise this construction in the following corollary:

Corollary 2. 

Let the paths start at $(0,0)$, end on the y-axis and use either of the following step sets:

$${\mathcal{P}}_1=\left\{(1,1),(-1,-1),(-1,0),(0,1)\right\}\mathit{or}{\mathcal{P}}_2=\left\{(1,1),(-1,1),(1,0),(0,1)\right\},$$

where the vertical step $(0, 1)$ occurs with weight β. Then, the generating function for the paths is given by

$${\displaystyle \frac{1-\beta x-\sqrt{{(1-\beta x)}^2-8x^2}}{4x^2}}.$$

This generating function also enumerates Motzkin paths of length n starting at $(0, 0)$ and ending on the x-axis, with step set $\left\{(1, 1),(1,-1),(1, 0)\right\}$, where each $(1,-1)$ step is weighted (or 2-coloured) with weight 2 and each $(1, 0)$ step is weighted with weight β (or β-coloured).

Note that for $\beta =1$, path 2 corresponds to the class of paths studied in [19], as they generalise the Delannoy paths. OEIS references for the generating function with values $\beta =0, 1, 2$ are listed in Table 1.

2.1.5. Chebyshev Transform Promotions

The following proposition establishes the connection between promotion via the Chebyshev transform and generalised Schröder paths.

Proposition 3. 

The ${\beta }^{th}$ Chebyshev transform of the generating function that enumerates Dyck paths with α-weighted $(1,-1)$ steps enumerates Schröder paths with β-weighted $(2,0)$ steps and α-weighted $(1,-1)$ steps.

Proof. 

The generating function for Dyck paths with $\alpha$-weighted $(1,-1)$ steps is ${\displaystyle \frac{1-\sqrt{1-4\alpha x^2}}{2\alpha x^2}}.$ Applying the ${\beta }^{th}$-Chebyshev transform gives

$$\left({\displaystyle \frac{1}{1-\beta x^2}},{\displaystyle \frac{x}{1-\beta x^2}}\right)·{\displaystyle \frac{1-\sqrt{1-4\alpha x^2}}{2\alpha x^2}}={\displaystyle \frac{1-\beta x^2-\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}}{2\alpha x^2}}.$$

The Chebyshev transform adds $\beta$-weighted $(2,0)$ steps, promoting Dyck paths to Schröder paths. The generating function has continued fraction expansion.

$${\displaystyle \frac{1}{1-\beta x^2-\frac{\alpha x^2}{1-\beta x^2-\frac{\alpha x^2}{1-\beta x^2-\frac{\alpha x^2}{\ddots }}}}}.$$

(5)

□

The generalised Chebyshev transform introduces a $\beta$-weighted Schröder step to Dyck paths with $\alpha$-weighted $(1,-1)$ steps. Here we see the T-fraction with a well known connection to lattice paths. The continued fraction above precisely coincides with that in Corollary 1, Equation (2). Some of the sequences are tabulated below for various values of $\alpha$ and $\beta$, with the OEIS reference of the sequence listed.

Example 5. 

For $\alpha =1, \beta =1$ and $n=4$ (as shown in Table 2), the promotion construction is expanded below. The matrix below shows the first few entries of the Chebyshev transform Riordan array $\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)$.

Table 2. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (5).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,1,0,2,0,5,0,14,\dots$	A000108	Aerated Catalan numbers
1	1	$1,0,2,0,6,0,22,0,90,\dots$	A006318	Aerated Schröder numbers
1	2	$1,0,3,0,12,0,57,0,300,\dots$	A047891	Aerated
2	0	$1,0,2,0,8,0,40,0,224,\dots$	A151374	Aerated
2	1	$1,0,3,0,15,0,93,0,645,\dots$	A103210	Aerated
2	2	$1,0,4,0,24,0,176,0,1440\dots$	A156017	Aerated

Table 2. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (5).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,1,0,2,0,5,0,14,\dots$	A000108	Aerated Catalan numbers
1	1	$1,0,2,0,6,0,22,0,90,\dots$	A006318	Aerated Schröder numbers
1	2	$1,0,3,0,12,0,57,0,300,\dots$	A047891	Aerated
2	0	$1,0,2,0,8,0,40,0,224,\dots$	A151374	Aerated
2	1	$1,0,3,0,15,0,93,0,645,\dots$	A103210	Aerated
2	2	$1,0,4,0,24,0,176,0,1440\dots$	A156017	Aerated

The $n^{th}$ entry of the vector ${(1, 0, 1, 0, 2\dots )}^T$ represents the number of Dyck paths of length n. These paths are promoted to Schröder paths via the Chebyshev transform. The coloured lattice paths on the right illustrate the construction of the six Schröder paths of length 4 through the promotion of Dyck paths via the Chebyshev transform.

1. 

The one Dyck path of length 0 is promoted to Schröder by adding two horizontal steps.

2. 

The one Dyck path of length 2 is promoted to Motzkin by adding one horizontal step that is uniquely placed to make three distinct Schröder paths.

3. 

The two Dyck paths of length 4 remain unchanged.

Previously, we observed that the Binomial transform promotion introduces level steps of length 1. Here we see the Chebyshev transform promotion inducing Schröder steps or level steps of length 2. Importantly, the bijections established under the Binomial transform promotion remain valid under the Chebyshev transform also. This observation leads to the following result.

Corollary 3. 

Let the paths start at $(0,0)$, end on the y-axis and use either of the following step sets:

$${\mathcal{S}}_1=\left\{(1,1),(-1,-1),(-1,0),(0,2)\right\}\mathit{or}{\mathcal{S}}_2=\left\{(1,1),(-1,1),(1,0),(0,2)\right\},$$

where the vertical step $(0,2)$ occurs with weight β. Then, the generating function for the paths is given by

$${\displaystyle \frac{1-\beta x^2-\sqrt{{(1-\beta x^2)}^2-8x^2}}{4x^2}}.$$

This generating function also enumerates Schröder paths of length $2n$, starting at $(0,0)$ and ending on the x-axis, with step set $\left\{(1,1),(1,-1),(2,0)\right\}$, where each $(1,-1)$ step is weighted (or 2-coloured) with weight 2 and each $(2,0)$ step is weighted with weight β (or β-coloured).

Before proceeding, we illustrate each of the path types with an example of length $n=4$.

Example 6. 

For $\alpha =2, \beta =1, n=4$, we have the following paths:

2.2. Promotion of a Family of Paths Unrestricted When Crossing the X-Axis

In this section, we extend our study to include paths that are permitted to cross below the x-axis. By relaxing this constraint, we observe new types of promotions and structural behaviour in the resulting path families. As before, we begin with a motivating example to illustrate the key ideas and once again introduce the two promotion Riordan matrices.

Example 7. 

The grand Motzkin–Schröder paths are enumerated by the sequence (OEIS A059345) which begins

$$1,1,4,9,29,82,255,\dots .$$

The generating function of the grand Motzkin–Schröder paths can be expressed as follows.

$$\begin{array}{cc}\hfill \left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)·t\left(x\right)& ={\displaystyle \frac{1}{\sqrt{1-2x-5x^2+2x^3+x^4}}}\hfill \\ \hfill & ={\displaystyle \frac{1}{1-x-x^2-\frac{2x^2}{1-x-x^2-\frac{x^2}{1-x-x^2-\dots }}}}.\hfill \end{array}$$

The sequence OEIS A059345 has its general term given by ${\sum }_{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n-k}{k}}\right)T_{n-2k}$. As seen in the last section, the Chebyshev matrix induces the ‘Schröder’ step in the paths. The first few rows of the matrices expand as follows. These are known generating functions of OEIS A059345.

$$\left(\begin{array}{cccccc}1& 0& 0& 0& 0& 0\\ 0& 1& 0& 0& 0& 0\\ 1& 0& 1& 0& 0& 0\\ 0& 2& 0& 1& 0& 0\\ 1& 0& 3& 0& 1& 0\\ 0& 3& 0& 4& 0& 1\end{array}\right)\left(\begin{array}{c}1\\ 1\\ 3\\ 7\\ 19\\ 51\end{array}\right)=\left(\begin{array}{c}1\\ 1\\ 4\\ 9\\ 29\\ 82\end{array}\right).$$

Once again we can decompose into the promotion matrices as follows:

$$\left({\displaystyle \frac{1}{1-x-x^2}},{\displaystyle \frac{x}{1-x-x^2}}\right)·{\displaystyle \frac{1}{\sqrt{1-4x^2}}}=\left({\displaystyle \frac{1}{1-x^2}},{\displaystyle \frac{x}{1-x^2}}\right)·\left({\displaystyle \frac{1}{1-x}},{\displaystyle \frac{x}{1-x}}\right)·{\displaystyle \frac{1}{\sqrt{1-4x^2}}}.$$

In particular, we see that the general term of the sequence OEIS A059345 may be expressed as ${\sum }_{k=0}^{\lfloor {\displaystyle \frac{n}{2}}\rfloor }\left({\displaystyle \genfrac{}{}{0pt}{}{n-k}{k}}\right)T_{n-2k}$.

2.2.1. Binomial Transform Promotions

The following proposition establishes the connection between the Binomial transform and generalised grand Motzkin paths.

Proposition 4. 

The ${\beta }^{th}$-Binomial transform of the generating function that enumerates grand Dyck paths with α-weighted $(1,-1)$ steps enumerates grand Motzkin paths with β-weighted $(1,0)$ steps and α-weighted $(1,-1)$ steps.

Proof. 

The generating function for grand Dyck paths with $\alpha$-weighted $(1,-1)$ steps is ${\displaystyle \frac{1}{\sqrt{1-4\alpha x^2}}}.$ Applying the ${\beta }^{th}$-Binomial transform gives

$$\left({\displaystyle \frac{1}{1-\beta x}},{\displaystyle \frac{x}{1-\beta x}}\right)·{\displaystyle \frac{1}{\sqrt{1-4\alpha x^2}}}={\displaystyle \frac{1}{\sqrt{{(1-\beta x)}^2-4\alpha x^2}}}.$$

(6)

The Binomial transform adds $\beta$-weighted $(1,0)$ steps, promoting grand Dyck paths to grand Motzkin paths. □

Sequences are tabulated in

Table 3. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (6).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,2,0,6,0,20,0,70,0,252\dots$	A126869
1	1	$1,1,3,7,19,51,141,393,1107,\dots$	A002426
1	2	$1,2,6,20,70,252,924,3432,12870\dots$	A000984
2	0	$1,0,4,0,24,0,160,0,1120,\dots$	A059304	Aerated
2	1	$1,1,5,13,49,161,581,\dots$	A084601
2	2	$1,2,8,32,136,592,2624,\dots$	A006139

for various values of $\alpha$ and $\beta$, with the OEIS reference of the sequence listed.

Example 8. 

For $\alpha =1, \beta =1$ for $n=4$; the promotion construction is expanded below.

The matrix above shows the first few entries of the Binomial transform seen previously in Example (3) in Section 2.1.1. The $n^{th}$ entry of the vector ${(1, 0, 2, 0, 6\dots )}^T$ represents the number of grand Dyck paths of length n. These paths are promoted to grand Motzkin paths via the Binomial transform. The coloured lattice paths on the right illustrate the construction of the 19 grand Motzkin paths of length 4 through the promotion of grand Dyck paths via the Binomial transform.

1. 

The one grand Dyck path of length 0 is promoted to grand Motzkin by adding four horizontal steps.

2. 

The two grand Dyck paths of length 2 are promoted to grand Motzkin by adding two horizontal steps. For each of these grand Dyck paths, adding two horizontal steps gives six different choices of paths.

3. 

The six Dyck paths of length 4 remain unchanged.

2.2.2. Bijections Arising from the Path Classifications in Table 3

Note that the table above reveals a bijection between grand Motzkin paths with weighted steps $\alpha$ and $\beta$, and Motzkin paths constrained to remain above the x-axis, where all steps are weighted by $\alpha$ and $\beta$, except for the $(1,-1)$ steps that return to the x-axis, which are assigned a weight of $2\alpha$. We begin with the continued fraction corresponding to paths where each return to the x-axis via a $(1,-1)$ step is given weight $2\alpha$, while all other $(1,-1)$ steps are given weight $\alpha$.

$${\displaystyle \frac{1}{1-\beta x-\frac{2\alpha x^2}{1-\beta x-\frac{\alpha x^2}{1-\beta x-\frac{\alpha x^2}{1-\beta x-\frac{\alpha x^2}{1-\beta x-\ddots }}}}}}.$$

(7)

From Proposition 2, we have the generating function for Motzkin-type paths with uniform weight $\alpha$ on down steps and $\beta$ on horizontal steps.

$${\displaystyle \frac{1-\beta x-\sqrt{{(1-\beta x)}^2-4\alpha x^2}}{2\alpha x^2}}.$$

(8)

Substituting (8) into (7), we obtain

$$\begin{array}{cc}\hfill & {\displaystyle \frac{1}{1-\beta x-2\alpha x^2\left(\frac{1-\beta x-\sqrt{{(1-\beta x)}^2-4\alpha x^2}}{2\alpha x^2}\right)}}\hfill \\ \hfill & ={\displaystyle \frac{1}{1-\beta x-\left(1-\beta x-\sqrt{{(1-\beta x)}^2-4\alpha x^2}\right)}}\hfill \\ \hfill & ={\displaystyle \frac{1}{\sqrt{{(1-\beta x)}^2-4\alpha x^2}}}.\hfill \end{array}$$

(9)

This corresponds to the generating function of grand Motzkin paths with uniform weights $\alpha$ and $\beta$, as shown in Proposition 4.

2.2.3. Constructive Bijection Between Restricted and Unrestricted Motzkin Paths

Let a path start at $(0,0)$ with step set $\left\{\right(1,1),(1,-1),(1,0\left)\right\}$, where every $(1,-1)$ step returning to the x-axis has a weight of $2\alpha$, while all other $(1,-1)$ steps have weight $\alpha$. We construct a bijection between this set of weighted paths and a family of reflected paths using the same step set, where all steps returning to the x-axis are uniformly weighted by $\alpha$.

1.

Single return to the x-axis.

A path that returns to the x-axis exactly once has a single, nontrivial reflection: its mirror image across the x-axis. If the return step is weighted $\alpha$, both the original and the reflected path contribute weight $\alpha$, assigning weight $2\alpha$ to this step in the restricted paths.

2.

Multiple returns to the x-axis.

If the path returns to the x-axis n times, it naturally decomposes into n excursions. Each excursion can be independently reflected about the x-axis, producing $2^n$ distinct path variants corresponding to the $2^n\alpha$ weighting for the steps returning to the x-axis in the restricted paths.

Example 9. 

For $\alpha =1, \beta =0$, we illustrate the bijection between the six paths of length 4 shown below.

2.2.4. Chebyshev Transform Promotions

The following proposition establishes the connection between promotion via the Chebyshev transform and generalised grand Schröder paths.

Proposition 5. 

The ${\beta }^{th}$ Chebyshev transform of the generating function that enumerates grand Dyck paths with α-weighted $(1,-1)$ steps enumerates grand Schröder paths with β-weighted $(2,0)$ steps and α-weighted $(1,-1)$ steps.

Proof. 

The generating function for grand Dyck paths with $\alpha$-weighted $(1,-1)$ steps is ${\displaystyle \frac{1}{\sqrt{1-4\alpha x^2}}}.$ Applying the ${\beta }^{th}$-Chebyshev transform gives

$$\left({\displaystyle \frac{1}{1-\beta x^2}},{\displaystyle \frac{x}{1-\beta x^2}}\right)·{\displaystyle \frac{1}{\sqrt{1-4\alpha x^2}}}={\displaystyle \frac{1}{\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}}}.$$

(10)

The Chebyshev transform adds $\beta$-weighted $(2,0)$ steps, promoting grand Dyck paths to grand Schröder paths. □

Table 4. Sequences indexed by parameters $\alpha$ and $\beta$ of the generating function in Equation (10).

$\mathit{\alpha }$	$\mathit{\beta }$	Sequence Expansion	OEIS ID	Note
1	0	$1,0,2,0,6,0,20,0,70,0,252,\dots$	A126869
1	1	$1,0,3,0,13,0,63,0,321,0,\dots$	A001850	Aerated
1	2	$1,0,4,0,22,0,136,0,886,0,5944,\dots$	A069835	Aerated
2	0	$1,0,4,0,24,0,160,0,1120,\dots$	A059304	Aerated
2	1	$1,0,5,0,37,0,305,0,2641,\dots$	A006442	Aerated
2	2	$1,0,6,0,52,0,504,0,5136,\dots$	A084773	Aerated

highlights some of the sequences on the OEIS for values of $\alpha$ and $\beta .$

Note that many of the OEIS references listed in Table 4 pertain to Delannoy numbers or paths. In particular, the central Delannoy paths are lattice paths from $(0,0)$ to $(n,n)$ using the step set $\left\{\right(1,0),(0,1),(1,1\left)\right\}$. These paths are structurally equivalent to grand Schröder paths, differing only in their terminal point: central Delannoy paths end at $(n,n)$, whereas grand Schröder paths typically return to the x-axis.

Example 10. 

For $\alpha =1, \beta =1$ and $n=4$, the promotion construction is expanded below. The

matrix above shows the first few entries of the Chebyshev transform and was seen previously in Example (5) in Section 2.1.5. The $n^{th}$ entry of the vector ${(1,0,2,0,6\dots )}^T$ represents the number of grand Dyck paths of length n. These paths are promoted to grand Schröder paths via the Chebyshev transform. The coloured lattice paths on the right illustrate the construction of the 13 grand Schröder paths of length 4 through the promotion of grand Dyck paths via the Chebyshev transform.

1. 

The one grand Dyck path of length 0 is promoted to grand Schröder by adding two horizontal steps.

2. 

The two grand Dyck paths of length 2 are promoted to grand Schröder by adding one horizontal step. For each of these grand Dyck paths, the horizontal step is uniquely placed to make three distinct grand Schröder paths.

3. 

The six Dyck paths of length 4 remain unchanged.

Similarly to the promotion of generalised grand Dyck paths under the Binomial transform promotion, here, we have a bijection between grand Schröder paths with weighted steps $\alpha$ and $\beta$ and Schröder paths constrained to remain above the x-axis, where all steps are weighted by $\alpha$ and $\beta$, except for the $(1,-1)$ steps that return to the x-axis, which are assigned a weight of $2\alpha$. We begin with the continued fraction corresponding to paths where each return to the x-axis via a $(1,-1)$ step given weight $2\alpha$, while all other $(1,-1)$ steps are given weight $\alpha$.

$${\displaystyle \frac{1}{1-\beta x^2-\frac{2\alpha x^2}{1-\beta x^2-\frac{\alpha x^2}{1-\beta x^2-\frac{\alpha x^2}{1-\beta x^2-\frac{\alpha x^2}{1-\beta x^2-\ddots }}}}}}.$$

(11)

From Proposition 3, we have the generating function for generalised Schröder paths with uniform weight $\alpha$ on down-steps and $\beta$ on horizontal steps.

$${\displaystyle \frac{1-\beta x^2-\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}}{2\alpha x^2}}.$$

(12)

Substituting (12) into (11), we obtain

$$\begin{array}{cc}\hfill & {\displaystyle \frac{1}{1-\beta x^2-2\alpha x^2\left(\frac{1-\beta x^2-\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}}{2\alpha x^2}\right)}}\hfill \\ \hfill & ={\displaystyle \frac{1}{1-\beta x^2-\left(1-\beta x^2-\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}\right)}}\hfill \\ \hfill & ={\displaystyle \frac{1}{\sqrt{{(1-\beta x^2)}^2-4\alpha x^2}}}.\hfill \end{array}$$

(13)

This corresponds to the generating function of grand Schröder paths, i.e., Schröder paths allowed to cross below the x-axis, with uniform weights $\alpha$ and $\beta$ as shown in Proposition 5. We illustrate each of the path types with an example of length $n=4$.

Example 11. 

For $\alpha =1$, $\beta =1$ and $n=4$, the 13 paths for restricted and unrestricted Schröder paths are drawn below.

3. Discussion

The results presented in this paper highlight the role of Riordan arrays in the enumeration of lattice paths. By applying the Binomial and Chebyshev transforms as forms of promotion, we are able to reinterpret classical lattice path families such as Dyck, Motzkin and Schröder paths within a coherent framework. The notion of promotion introduced in this work builds upon earlier studies in enumerative combinatorics, particularly those involving weighted paths, continued fractions (e.g., Flajolet [13]), and Riordan group theory (e.g., Shapiro et al. [1,4]). The main contributions are as follows:

• Formalisation of promotion as the action of Riordan arrays on generating functions for restricted paths.
• Demonstration that the Binomial transform promotes Dyck paths to Motzkin paths and the Chebyshev transform promotes Dyck paths to Schröder paths.
• Derivation of generalised generating functions for these promoted paths.
• Introduction of bijective constructions linking promoted paths to other path sets found in the literature.
• Extension of the framework to unrestricted path families and construction of a bijection between restricted and unrestricted paths.

These findings demonstrate that Riordan arrays offer a unifying framework for deriving and interpreting families of lattice paths. This suggests that Riordan array promotions can serve as a foundation for further exploration, particularly in discovering new transforms applicable to a broader range of path families.