A new statistic on Dyck paths for counting 3-dimensional Catalan words
From MaRDI portal
Publication:2111910
DOI10.1016/J.DISC.2022.113247zbMATH Open1506.05010arXiv2205.09686OpenAlexW4309220301MaRDI QIDQ2111910FDOQ2111910
Kassie Archer, Christina Graves
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2205.09686
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- Title not available (Why is that?)
- Generalizing Narayana and Schröder numbers to higher dimensions
- Motzkin numbers
- Andre's reflection proof generalized to the many-candidate ballot problem
- Pattern-restricted permutations composed of 3-cycles
- A bijection between two subfamilies of Motzkin paths
- An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
Cited In (1)
Uses Software
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)