On rational Dyck paths and the enumeration of factor-free Dyck words
From MaRDI portal
Publication:1752582
DOI10.1016/j.dam.2018.02.020zbMath1387.05010arXiv1606.02183OpenAlexW2962801703WikidataQ130062237 ScholiaQ130062237MaRDI QIDQ1752582
Daniel Birmajer, Michael D. Weiner, Juan B. Gil
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.02183
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Special sequences and polynomials (11B83)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dyck paths with coloured ascents
- Bell polynomials and \(k\)-generalized Dyck paths
- General identities on Bell polynomials
- On the enumeration and generation of generalized Dyck words
- Some convolution identities and an inverse relation involving partial Bell polynomials
This page was built for publication: On rational Dyck paths and the enumeration of factor-free Dyck words