We discuss tilings of a grid (of size n × 2) with dominoes of size 2 × 1. Parameters that might be called“longest run” are investigated, in terms of generating functions and also asymptotically. Extensionsare also mentioned
Tiling Generating function Asymptotic Bootstrapping Mellin transform Fibonacci numbers
| Birincil Dil | İngilizce |
|---|---|
| Yazarlar | |
| Yayımlanma Tarihi | 1 Mart 2014 |
| DOI | https://doi.org/10.13069/jacodesmath.09554 |
| IZ | https://izlik.org/JA35EB72XP |
| Yayımlandığı Sayı | Yıl 2014 Cilt: 1 Sayı: 1 |