STATISTICS of DOMINO TILINGS on A RECTANGULAR BOARD
© 2019 Fibonacci Association. All rights reserved. It is well-known that the Fibonacci sequence, Fn, is the number of ways to cover a 2-by-(n−1) board using only horizontal (H) or vertical (V) 2-by-1 dominoes. The number of ways to tile a rectangular m-by-n board by these dominoes was given in 1961...
Saved in:
Main Author: | Thotsaporn Aek Thanatipanonda |
---|---|
Other Authors: | Mahidol University |
Format: | Article |
Published: |
2020
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/60506 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
A curious family of binomial determinants that count rhombus tilings of a holey hexagon
by: Christoph Koutschan, et al.
Published: (2020) -
Computer-based approach on tiling deficient rectangular boards with trominoes
by: Rafael, May Ann L., et al.
Published: (1992) -
Beyond Zudilin's conjectured q-analogue of Schmidt's problem
by: Thotsaporn Aek Thanatipanonda
Published: (2018) -
Binomial determinants for tiling problems yield to the holonomic ansatz
by: Hao Du, et al.
Published: (2022) -
A multi-computational exploration of some games of pure chance
by: Thotsaporn Aek Thanatipanonda, et al.
Published: (2020)