arXiv Analytics

Sign in

arXiv:0805.4358 [math.CO]AbstractReferencesReviewsResources

Potential Polynomials and Motzkin Paths

Yidong Sun

Published 2008-05-28Version 1

A {\em Motzkin 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 $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes below the x-axis. A {\em $u$-segment {\rm (resp.} $h$-segment {\rm)}} of a Motzkin path is a maximum sequence of consecutive up-steps ({\rm resp.} horizontal-steps). The present paper studies two kinds of statistics on Motzkin paths: "number of $u$-segments" and "number of $h$-segments". The Lagrange inversion formula is utilized to represent the weighted generating function for the number of Motzkin paths according to the statistics as a sum of the partial Bell polynomials or the potential polynomials. As an application, a general framework for studying compositions are also provided.

Comments: 11 pages, 1 figures; Discreste Math., to appear
Categories: math.CO
Subjects: 05A05, 05A15
Related articles: Most relevant | Search more
arXiv:0805.1273 [math.CO] (Published 2008-05-09)
Bell Polynomials and $k$-generalized Dyck Paths
arXiv:0805.1280 [math.CO] (Published 2008-05-09)
Pattern Avoidance in Generalized Non-crossing Trees
arXiv:2305.17576 [math.CO] (Published 2023-05-27)
Lagrange Inversion Formula by Induction