Fibonacci and Catalan Numbers Meet in Staircase Polyominoes
Electronic Proceedings in Theoretical Computer Science · 2026-06-07 · 445 · 16-20
DOI: 10.4204/eptcs.445.3 ↗At a glance
Journal article in Electronic Proceedings in Theoretical Computer Science, published online on 2026-06-07. Written by Jean-Luc Baril and 3 co-authors. 9 references.
Abstract (original language)
We study Fibonacci (staircase) polyominoes, a class of column-convex polyominoes whose lower boundary is a staircase with unit vertical steps. We derive multivariate generating functions that refine Turban's Fibonacci-number enumeration by tracking additional perimeter and area parameters. The proofs use a catalytic functional equation and, in a perimeter specialization, the kernel method, leading to explicit closed forms and Catalan-number coefficient formulas.
Cite
APA
Baril, J., Ramírez, J. L., Ramírez, S., & Villamizar, D. (2026). Fibonacci and Catalan Numbers Meet in Staircase Polyominoes. Electronic Proceedings in Theoretical Computer Science, 445, 16-20. https://doi.org/10.4204/eptcs.445.3
Vancouver
Baril J, Ramírez JL, Ramírez S, Villamizar D. Fibonacci and Catalan Numbers Meet in Staircase Polyominoes. Electronic Proceedings in Theoretical Computer Science. 2026;445:16-20. doi:10.4204/eptcs.445.3
BibTeX
@article{Baril2026,
author = {Baril, Jean-Luc and Ramírez, José Luis and Ramírez, Samuel and Villamizar, Diego},
title = {Fibonacci and Catalan Numbers Meet in Staircase Polyominoes},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {445},
pages = {16--20},
doi = {10.4204/eptcs.445.3}
}
EUVIMED