On factor-free Dyck words with half-integer slope
DOI10.1016/J.AAM.2018.04.005zbMATH Open1388.05011arXiv1804.11244OpenAlexW2963990664WikidataQ129824281 ScholiaQ129824281MaRDI QIDQ1637598FDOQ1637598
Authors: Daniel Birmajer, Juan B. Gil, Michael D. Weiner
Publication date: 8 June 2018
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11244
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Special sequences and polynomials (11B83)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the enumeration and generation of generalized Dyck words
- A New Approach to Cross-Bifix-Free Sets
- Some convolution identities and an inverse relation involving partial Bell polynomials
- Generalized Dyck paths
- Non-Overlapping Codes
- Lattice paths of slope \(2/5\)
- Linear recurrence sequences and their convolutions via Bell polynomials
Cited In (4)
Uses Software
This page was built for publication: On factor-free Dyck words with half-integer slope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637598)