pith. sign in

arxiv: 1304.0351 · v2 · pith:3AI2425Jnew · submitted 2013-04-01 · 🧮 math.CO

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

classification 🧮 math.CO
keywords pathsnumberbijectivehumpsorderpeaksproofssuper
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.