Bell Polynomials and $k$-generalized Dyck Paths
| dc.creator | Mansour, Toufik | |
| dc.creator | Sun, Yidong | |
| dc.date | 2008-05-09 | |
| dc.date.accessioned | 2026-07-07T09:37:58Z | |
| dc.date.available | 2026-07-07T09:37:58Z | |
| dc.description | A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes below the x-axis. The present paper studies three kinds of statistics on $k$-generalized Dyck paths: "number of $u$-segments", "number of internal $u$-segments" and "number of $(u,h)$-segments". The Lagrange inversion formula is used to represent the generating function for the number of $k$-generalized Dyck paths according to the statistics as a sum of the partial Bell polynomials or the potential polynomials. Many important special cases are considered leading to several surprising observations. Moreover, enumeration results related to $u$-segments and $(u,h)$-segments are also established, which produce many new combinatorial identities, and specially, two new expressions for Catalan numbers. | |
| dc.description | 15pages, 1 figure. To appear in Discrete Applied Mathematics | |
| dc.identifier | https://arxiv.org/abs/0805.1273 | |
| dc.identifier | http://arxiv.org/abs/0805.1273 | |
| dc.identifier | doi:10.1016/j.dam.2007.10.009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160645 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05;05A15 | |
| dc.title | Bell Polynomials and $k$-generalized Dyck Paths | |
| dc.type | text |