On Enumeration and Entropy of Ribbon Tilings
Open Access
- 7 April 2023
- journal article
- research article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (2) , P2.15
Abstract
The paper considers ribbon tilings of large regions and their per-tile entropy (the logarithm of the number of tilings divided by the number of tiles). For tilings of general regions by tiles of length $n$, we give an upper bound on the per-tile entropy as $n - 1$. For growing rectangular regions, we prove the existence of the asymptotic per tile entropy and show that it is bounded from below by $\log_2 (n/e)$ and from above by $\log_2(en)$. For growing generalized "Aztec Diamond" regions and for growing "stair" regions, the asymptotic per-tile entropy is calculated exactly as $1/2$ and $\log_2(n + 1) - 1$, respectively.
Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Covering rectangles by few monotonous polyominoesActa Mathematica Hungarica, 2023
- Hard and easy instances of L-tromino tilingsTheoretical Computer Science, 2020
- Enumeration of octagonal tilingsTheoretical Computer Science, 2015
- Tilings of rectangles with T-tetrominoesTheoretical Computer Science, 2004
- The Rank and Minimal Border Strip Decompositions of a Skew PartitionJournal of Combinatorial Theory, Series A, 2002
- Enumerative Combinatorics1999
- Alternating-Sign Matrices and Domino Tilings (Part I)Journal of Algebraic Combinatorics, 1992
- Acyclic orientations of graphsDiscrete Mathematics, 1973
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968
- The statistics of dimers on a latticePhysica, 1961