We consider the problem of counting the set of Da b of Dyck pathsinscribedinarectangleofsize a x b. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers diagrams associated to Dyck paths, we derive formulas for the enumeration of Da b with a and b non relatively prime, in terms of Catalan numbers.
CITATION STYLE
Blazek, J. E. (2015). New formulas for Dyck paths in a rectangle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9304, pp. 85–96). Springer Verlag. https://doi.org/10.1007/978-3-319-23660-5_8
Mendeley helps you to discover research relevant for your work.