Counting humps in Motzkin paths
From MaRDI portal
Publication:765354
DOI10.1016/j.dam.2011.08.018zbMath1236.05011arXiv1109.2661OpenAlexW1999722679WikidataQ60692135 ScholiaQ60692135MaRDI QIDQ765354
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2661
Motzkin pathsbinomial coefficientsDyck pathsNarayana numberpeaksSchröder pathsdouble counting super-Schröder pathshumps
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Related Items (8)
Unnamed Item ⋮ Enumerating symmetric pyramids in Motzkin paths ⋮ Counting humps and peaks in generalized Motzkin paths ⋮ Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata ⋮ Motzkin paths, Motzkin polynomials and recurrence relations ⋮ Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs ⋮ Bijective counting of humps and peaks in \((k, a)\)-paths
Uses Software
Cites Work
This page was built for publication: Counting humps in Motzkin paths