Abstract
Paths that consist of up-steps of one unit and down-steps of \(k\) units, being bounded below by a horizontal line \(-t\), behave like \(t+1\) ordered tuples of \(k\)-Dyck paths, provided that \(t\le k\). We describe the general case, allowing \(t\) also to be larger. Arguments are bijective and/or analytic.
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 callMore From: Journal of Combinatorial Mathematics and Combinatorial Computing
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.
