Bell polynomials and k-generalized Dyck paths

A k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane integer lattice ZxZ consisting of horizontal-steps (k,0) for a given integer k>=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.

[1]  Robert Donaghey,et al.  Motzkin Numbers , 1977, J. Comb. Theory, Ser. A.

[2]  O. Kuzmin,et al.  On partition polynomials , 2001 .

[3]  Renzo Sprugnoli,et al.  Left-inversion of combinatorial sums , 1998, Discret. Math..

[4]  Frank R. Bernhart Catalan, Motzkin, and Riordan numbers , 1999, Discret. Math..

[5]  Toufik Mansour,et al.  Dyck paths and partial Bell polynomials , 2008, Australas. J Comb..

[6]  D. Klarner,et al.  Correspondences between plane trees and binary sequences , 1970 .

[7]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .

[8]  Herbert S. Wilf,et al.  Generating functionology , 1990 .