Abstract
For lattice paths in strips which begin at (0,0) and have only up steps U:(i,j)→(i+1,j+1) and down steps D:(i,j)→(i+1,j−1), let An,k denote the set of paths of length n which start at (0,0), end on heights 0 or −1, and are contained in the strip −⌊k+12⌋≤y≤⌊k2⌋ of width k, and let Bn,k denote the set of paths of length n which start at (0,0) and are contained in the strip 0≤y≤k. We establish a bijection between An,k and Bn,k.The generating functions for the subsets of these two sets are discussed as well. Furthermore, we provide another bijection between An,3 and Bn,3 by translating the paths to two types of trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
