A new statistic on Dyck paths for counting 3-dimensional Catalan words
From MaRDI portal
Publication:2111910
Abstract: A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path , a recently defined statistic counts the number of Catalan words with the property that any subword on two letters is exactly . In this paper, we enumerate Dyck paths with this statistic equal to certain values, including all primes. The formulas obtained are in terms of Motzkin numbers and Motzkin ballot numbers.
Recommendations
Cites work
- scientific article; zbMATH DE number 1242264 (Why is no real title available?)
- A bijection between two subfamilies of Motzkin paths
- An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
- Andre's reflection proof generalized to the many-candidate ballot problem
- Generalizing Narayana and Schröder numbers to higher dimensions
- Motzkin numbers
- Pattern-restricted permutations composed of 3-cycles
Cited in
(3)
This page was built for publication: A new statistic on Dyck paths for counting 3-dimensional Catalan words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111910)