Potential polynomials and Motzkin paths

DOI10.1016/J.DISC.2008.06.017MaRDI QIDQ1043605zbMATH OpenOpenAlexFDO

Authors Yidong Sun

Publication date 9 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.4358

zbMATH Keywords

compositionsMotzkin pathspartial Bell polynomialspotential polynomials

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Abstract: A {em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $mathbbZimesmathbbZ$ 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 { m (resp.} $h$-segment { m)}} of a Motzkin path is a maximum sequence of consecutive up-steps ({ m 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.

Recommendations

• Bell polynomials and k-generalized Dyck paths
• Inverses of Motzkin and Schröder paths
• Dyck paths and partial Bell polynomials
• scientific article; zbMATH DE number 1522334
• Some statistics on generalized Motzkin paths with vertical steps

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 3528241 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 2076914 (Why is no real title available?)
• scientific article; zbMATH DE number 2170412 (Why is no real title available?)
• scientific article; zbMATH DE number 2124095 (Why is no real title available?)
• scientific article; zbMATH DE number 2214409 (Why is no real title available?)
• A general bijective algorithm for trees.
• Bell polynomials and k-generalized Dyck paths
• Compositions with parts constrained by the leading summand.
• Correspondences between plane trees and binary sequences
• Dyck paths and partial Bell polynomials
• On Carlitz compositions
• On new identities for Bell's polynomials

Cited in

(8)

• ECO method and hill-free generalized Motzkin paths
• Motzkin paths, Motzkin polynomials and recurrence relations
• Inverses of Motzkin and Schröder paths
• Minimal and maximal plateau lengths in Motzkin paths
• Some statistics on generalized Motzkin paths with vertical steps
• Crossings, Motzkin paths and moments
• Motzkin paths with exactly one weak ascent
• Enumeration of the Motzkin paths above a line of rational slope

This page was built for publication: Potential polynomials and Motzkin paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043605)