1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
An upper bound on the per-tile entropy of ribbon tilings
Simon Blackburn, Yinsong Chen, Vladislav Kargin
This paper considers -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 t…
math.CO2023
The Number of Ribbon Tilings for Strips
Yinsong Chen, Vladislav Kargin
First, we consider order- ribbon tilings of an -by- rectangle where and are much larger than . We prove the existence of the growth rate of the…
math.PR2023★ 1 cited
On enumeration and entropy of ribbon tilings
Yinsong Chen, Vladislav Kargin
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 regio…