English

The Riordan Group and Symmetric Lattice Paths

Combinatorics 2009-06-11 v1

Abstract

In this paper, we study symmetric lattice paths. Let dnd_{n}, mnm_{n}, and sns_{n} denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schr\"oder paths of length 2n2n, respectively. By using Riordan group methods we obtain six identities relating dnd_{n}, mnm_{n}, and sns_{n} and also give two of them combinatorial proofs. Finally, we investigate some relations satisfied by the generic element of some special Riordan arrays and get the average mid-height and the average number of points on the x-axis of symmetric Dyck paths of length 2n.2n.

Keywords

Cite

@article{arxiv.0906.1844,
  title  = {The Riordan Group and Symmetric Lattice Paths},
  author = {Li-Hua Deng and Eva Y. P. Deng and Louis W. Shapiro},
  journal= {arXiv preprint arXiv:0906.1844},
  year   = {2009}
}

Comments

16 pages

R2 v1 2026-06-21T13:11:41.245Z