Bijective counting of humps and peaks in (k, a)-paths

DOI10.1016/J.DAM.2015.04.013MaRDI QIDQ2355745zbMATH OpenOpenAlexWikidataFDO

Authors Sherry H. F. Yan

Publication date 24 July 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\((k,a)\)-pathhumppeak

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Abstract: Recently, Mansour and Shattuck related the total number of humps in all of the $(k,a)$-paths of order $n$ to the number of super $(k,a)$-paths, which generalized previous results concerning the cases when $k=1$ and $a=1$ or $a=infty$. They also derived a relation on the total number of peaks in all of the $(k,a)$-paths of order $n$ and the number of super $(k,a)$-paths, and asked for bijective proofs. In this paper, we will give bijective proofs of these two relations.

Recommendations

• Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
• Counting humps and peaks in generalized Motzkin paths
• Counting humps in Motzkin paths
• Refinements of two identities on \((n,m)\)-Dyck paths
• Counting peaks and valleys in \(k\)-colored Motzkin paths

Cites work

• Counting humps and peaks in generalized Motzkin paths
• Counting humps in Motzkin paths
• Dyck path enumeration
• Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
• scientific article; zbMATH DE number 3270295 (Why is no real title available?)
• Three Hoppy path problems and ternary paths

Cited in

(6)

• Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths
• Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
• Bijective counting of Kreweras walks and loopless triangulations
• Counting humps and peaks in generalized Motzkin paths
• Humps in Motzkin paths and standard Young tableaux in a (2, 1)-hook
• Counting humps in Motzkin paths

This page was built for publication: Bijective counting of humps and peaks in \((k, a)\)-paths

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