Affiliation:
1. Dipartimento di Matematica e Informatica “U. Dini” , Università degli Studi di Firenze , Viale G.B. Morgagni 65 , Firenze , Italy
Abstract
Abstract
In From Fibonacci to Catalan permutations, Barcucci et al., 2006, a journey by pattern avoiding permutations from the Fibonacci to Catalan sequences is illustrated. In this paper we make a similar journey, but on Dyck paths.
Reference8 articles.
1. [1] A. Bacher, Generalized Dyck paths of bounded height, arXiv:1303.2724.
2. [2] E. Barcucci, A. Bernini and R. Pinzani, Strings from linear recurrences: a Gray code, in: Lecroq, T. and Puzynina, S. (Eds.), Combinatorics on Words, 13th International Conference, WORDS 2021, Lecture Notes in Comput. Sci., 12847 (2021) 40–49.
3. [3] E. Barcucci, A. Bernini and M. Poneti, From Fibonacci to Catalan permutations, Pure Math. Appl. (PU.M.A), 17 (2006) 1–17.
4. [4] M. Bousquet-Mélou, Discrete excursions, Sém. Lothar. Combin., 57 (2008) B57d.10.1016/j.endm.2008.06.016
5. [5] J. J. Bravo, J. L. Herrera and J. L. Ramírez, Combinatorial interpretation of generalized Pell numbers, J. Integer Seq. 23 (2020) 20.2.1.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dyck Paths Enumerated by the Q-bonacci Numbers;Electronic Proceedings in Theoretical Computer Science;2024-06-24