Abstract
Let us call a lattice path in Z×Z from (0,0) to (n,0) using U=(1,k), D=(1,−1), and H=(a,0) steps and never going below the x-axis, a (k,a)-path (of order n). A super (k,a)-path is a (k,a)-path which is permitted to go below the x-axis. We relate the total number of humps in all of the (k,a)-paths of order n to the number of super (k,a)-paths, where a hump is defined to be a sequence of steps of the form UHiD, i≥0. This generalizes recent results concerning the cases when k=1 and a=1 or a=∞. A similar relation may be given involving peaks (consecutive steps of the form UD).
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 callDisclaimer: 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.
