Answers are grounded in this paper and cite their sources.
This paper considers n-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by log₂ n. This bound improves the best previously known bounds of $n-1$ for general regions, and the asymptotic upper bound of log₂ (en) for growing rectangles, due to Chen and Kargin.
No takes yet. Share an insight, caveat, or question.
Blackburn⋆ et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: