Abstract
This paper concentrates on the set $$\mathcal {V}_n$$ of weighted Dyck paths of length 2n with special restrictions on the level of valleys. We first give its explicit formula of the counting generating function in terms of certain weight functions. When the weight functions are specialized, some connections are builded between $$\mathcal {V}_n$$ and other classical combinatorial structures such as (a, b)-Motzkin paths, q-Schröder paths, Delannoy paths and complete k-ary trees. Some bijections are also established between these settings and $$\mathcal {V}_n$$ subject to certain special weight functions.
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.
