Table of Contents: :: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Blackburn, Simon, Chen, Yinsong, Kargin, Vladislav
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2408.09272
Tags:	Add Tag No Tags, Be the first to tag this record!

Table of Contents:

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_2 n$. This bound improves the best previously known bounds of $n-1$ for general regions, and the asymptotic upper bound of $\log_2 (en)$ for growing rectangles, due to Chen and Kargin.