From the Fibonacci to Pell numbers and beyond via Dyck paths

Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo

doi:10.2478/puma-2022-0004

.blurhash-client-img { display: none !important; }

From the Fibonacci to Pell numbers and beyond via Dyck paths

Pure Mathematics and Applications

Volume 30 (2022): Issue 1 (June 2022)

By: Elena Barcucci, Antonio Bernini and Renzo Pinzani

Open Access

|Jun 2022

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.

References

[1] A. Bacher, Generalized Dyck paths of bounded height, arXiv:1303.2724.
Search in Google Scholar Back to article
[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.
Search in Google Scholar Back to article
[3] E. Barcucci, A. Bernini and M. Poneti, From Fibonacci to Catalan permutations, Pure Math. Appl. (PU.M.A), 17 (2006) 1–17.
Search in Google Scholar Back to article
[4] M. Bousquet-Mélou, Discrete excursions, Sém. Lothar. Combin., 57 (2008) B57d.10.1016/j.endm.2008.06.016
Search in Google Scholar Back to article
[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.
Search in Google Scholar Back to article
[6] D. E. Knuth, The Art of Computer Programming: Sorting and Searching, Vol. 3, 1966, Addison-Wesley.
Search in Google Scholar Back to article
[7] N. J. A. Sloane and The OEIS Foundation Inc., The on-line encyclopedia of integer sequences, http://oeis.org.
Search in Google Scholar Back to article
[8] V. Vajnovszki, A loopless generation of bitstrings without p consecutive ones, in: Calude, C. S., Dinneen, M. J. and Sburlan, S. (Eds.), Combinatorics, Computability and Logic (2001), Discrete Mathematics and Theoretical Computer Science, Springer, London, pp. 227–240.
Search in Google Scholar Back to article

DOI: https://doi.org/10.2478/puma-2022-0004 | Journal eISSN: 1788-800X

Journal RSS Feed

Language: English

Page range: 17 - 22

Submitted on: Mar 31, 2022

Accepted on: May 15, 2022

Published on: Jun 18, 2022

Published by: Corvinus University of Budapest

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

Dyck paths with bounded height,

k-generalized Fibonacci,

generalized Pell numbers

Related subjects:

Computer sciences,

Theoretical computer sciences,

Business and economics,

Mathematics and statistics for economists,

Mathematics,

Analysis,

Differential equations and dynamical systems

© 2022 Elena Barcucci, Antonio Bernini, Renzo Pinzani, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous article Volume 30 (2022): Issue 1 (June 2022)Next article