Tiling of dominoes with ranked colors

Khadir, O. and Németh, László and Szalay, László (2024) Tiling of dominoes with ranked colors. RESULTS IN MATHEMATICS, 79 (7). ISSN 1422-6383

[thumbnail of s00025-024-02284-3.pdf] Text
s00025-024-02284-3.pdf

Download (393kB)
Official URL: https://doi.org/10.1007/s00025-024-02284-3

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×n)—board where the colors have a prescribed order of preference and the size of colored dominoes is bounded by (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. © The Author(s) 2024.

Tudományterület / tudományág

natural sciences > mathematics and computer sciences

Faculty

Not relevant

Institution

Soproni Egyetem

Item Type: Article
Additional Information: Export Date: 04 October 2024;
SWORD Depositor: Teszt Sword
Depositing User: Csaba Horváth
Identification Number: MTMT:35434385
Date Deposited: 08 Oct 2024 10:44
Last Modified: 08 Oct 2024 10:44
URI: http://publicatio.uni-sopron.hu/id/eprint/3282

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year