Work

Tiling of dominoes with ranked colors

Year: 2024

Type: article

Abstract: Several articles deal with tilings with various colors and shapes. In this paper, we present a new type of tiling problem of a $$(1\times n)$$ ( 1 × n ) —board where the colors have a prescribed order of preference and the size of colored dominoes is bounded by $$(1\times s)$$ ( 1 × s ) . We show that the total number of tilings can be given as a linearly recurrent sequence of order ks, and at the same time by a higher order self-convolution of s-generalized Fibonacci sequences.

Source: Results in Mathematics

DOI: 10.1007/s00025-024-02284-3

Authors: Omar Khadir, László Németh, László Szalay

Institutions: Université Hassan II Mohammedia, University of Hassan II Casablanca, University of Sopron, J. Selye University

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funder: Soproni Egyetem