Combinatorial chessboard tilings (Q2883416)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6032422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial chessboard tilings |
scientific article; zbMATH DE number 6032422 |
Statements
10 May 2012
0 references
chessboard tiling
0 references
recurrence relation
0 references
colored tiles
0 references
Cayley-Hamilton theorem
0 references
domino
0 references
triomino
0 references
0.89995325
0 references
0.8903283
0 references
0.88849854
0 references
0.88400257
0 references
0.8823312
0 references
Combinatorial chessboard tilings (English)
0 references
In this paper the number \(a_n\) of ways to tile a \(k\times n\) board using tiles \(T_1,T_2,\ldots ,T_j\) (colored or not) is considered (a tile is placed on the board by transition only). For three examples with \(2\leq j\leq 3\) recurrence and close formulas are deduced. Finally, the AA. assert that the number of ways to tile any \(k\times n\) board \(B\), with \(k\) fixed and using any finite set of tiles, satisfies a linear, homogeneous, constant coefficient recurrence and the same conclusion holds if a finite fixed pattern of squares is deleted from the left (or right) side of \(B\).
0 references
