Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
418861 | Discrete Applied Mathematics | 2015 | 5 Pages |
Abstract
Recently, Mansour and Shattuck related the total number of humps in all of the (k,a)(k,a)-paths of order nn to the number of super (k,a)(k,a)-paths, which generalized previous results concerning the cases when k=1k=1 and a=1a=1 or a=∞a=∞. They also derived a relation on the total number of peaks in all of the (k,a)(k,a)-paths of order nn and the number of super (k,a)(k,a)-paths, and asked for bijective proofs. In this paper, we will give bijective proofs of these two relations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sherry H.F. Yan,