Abstract
Ternary paths consist of an upstep of one unit, a downstep of two units, never go below the x-axis, and return to the x-axis. This paper addresses the enumeration of partial ternary paths, ending at a given level i, reading the path either from left-to-right or from right-to-left. Since the paths are not symmetric with respect to left vs. right, as classical Dyck paths, this leads to different results. The right-to-left enumeration is quite challenging, but leads at the end to very satisfying results. The methods are elementary (solving systems of linear equations). In this way, several conjectures left open in Naiomi Cameron’s Ph.D. thesis could be successfully settled.
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.
