Riordan matrices and higher-dimensional lattice walks

An algebraic combinatorial method is used to count higher-dimensional lattice walks in Z^m${\mathbb{Z}}^m$ that are of length n ending at height k. As a consequence of using the method, Sands’ two-dimensional lattice walk counting problem is generalized to higher dimensions. In addition to Sands’ problem, another subclass of higher-dimensional lattice walks is also counted. Catalan type solutions are obtained and the first moments of the walks are computed. The first moments are then used to compute the average heights of the walks. Asymptotic estimates are also given.