Abstract
We revisit Golomb’s tiling hierarchy for finite sets of polyominoes. We consider the case when only translations are allowed for the tiles in a tile set. In this classification, for several levels in Golomb’s hierarchy, more types need to be considered. First, we show that there is no general relationship among the types corresponding to a fixed level for the existence of tilings. Second, we review the relationships among the levels from Golomb’s hierarchy that are still valid in this setup, and third, we give counterexamples for several relationships in Golomb’s hierarchy that fail. As a consequence of the results, we show alternative tiling hierarchies. We also show some unexpected additions to all of the above hierarchies and discuss various implications of tiling capabilities if deficient regions are added to the pool.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: IEEE Transactions on Information Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.