Enumerating runs, valleys, and peaks in Catalan words
classification
🧮 math.CO
keywords
peaksvalleysrunsascentscatalandescentsnumbersome
read the original abstract
We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (descents), $\ell$-valleys, valleys, symmetric valleys, $\ell$-peaks, peaks, and symmetric peaks. We also establish some bijections with restricted Dyck paths and ordered trees that transports some statistics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.