English

Potential Polynomials and Motzkin Paths

Combinatorics 2008-05-29 v1

Abstract

A {\em Motzkin path} of length nn is a lattice path from (0,0)(0,0) to (n,0)(n,0) in the plane integer lattice Z×Z\mathbb{Z}\times\mathbb{Z} consisting of horizontal-steps (1,0)(1, 0), up-steps (1,1)(1,1), and down-steps (1,1)(1,-1), which never passes below the x-axis. A {\em uu-segment {\rm (resp.} hh-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 uu-segments" and "number of hh-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.

Keywords

Cite

@article{arxiv.0805.4358,
  title  = {Potential Polynomials and Motzkin Paths},
  author = {Yidong Sun},
  journal= {arXiv preprint arXiv:0805.4358},
  year   = {2008}
}

Comments

11 pages, 1 figures; Discreste Math., to appear

R2 v1 2026-06-21T10:44:59.101Z