Year: 2024
Type: article
Abstract: Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled (1 × n ) and (2 × n ) square grids by covering them with squares and dominoes. We describe these numbers not only recursively, but also as rational polynomial linear combinations of Fibonacci numbers.
Source: Mathematica Slovaca
DOI: 10.1515/ms-2024-0099
Author: László Németh
Institution: University of Sopron
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4405107047