Riordan Arrays and Difference Equations of Subdiagonal Lattice Paths

We study lattice paths by combinatorial methods on the positive lattice. We give some identity that produces the functional equations and generating functions to counting the lattice paths on or below the main diagonal. Also, we consider the subdiagonal lattice paths in relation to lower triangular arrays. This presents a Riordan array in conjunction with the columns of the matrix of the coefficients of certain formal power series by implying an infinite lower triangular matrix \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F=(f_{x,y})_{x,y\geqslant 0} $\end{document}. We derive new combinatorial interpretations in terms of restricted lattice paths for some Riordan arrays.