Abstract
This paper deals with the enumeration of Grand-Dyck paths according to the statistic "number of occurrences of $\tau$" for every string $\tau$ of length $3$, taking into account the number of flaws of the path. Consequently, some new refinements of the Chung-Feller theorem are obtained.
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.
