Abstract
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if the set of instances is restricted to sets of 5 polyominoes. In the case of tiling by translations only, we prove that the problem is undecidable for sets of 11 polyominoes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Grünbaum, B., Shephard, G.C.: Tilings and patterns. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1989)
Berger, R.: The undecidability of the domino problem. Memoirs American Mathematical Society 66 (1966)
Golomb, S.W.: Tiling with polyominoes. Journal of Combinatorial Theory 1(2), 280–296 (1966)
Golomb, S.W.: Tiling with sets of polyominoes. Journal of Combinatorial Theory 9(1), 60–71 (1970)
Post, E.L.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society 52, 264–268 (1946)
Claus, V.: Some remarks on PCP(k) and related problems. Bulletin of the EATCS 12, 54–61 (1980)
Matiyasevich, Y., Sénizergues, G.: Decision problems for semi-thue systems with a few rules. Theoretical Computer Science 330(1), 145–169 (2005)
Wijshoff, H.A.G., van Leeuwen, J.: Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino. Information and Control 62(1), 1–25 (1984)
Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete and Computational Geometry 6(1), 575–592 (1991)
Gambini, I., Vuillon, L.: An algorithm for deciding if a polyomino tiles the plane. Theoretical Informatics and Applications 41(2), 147–155 (2007)
Ammann, R., Grünbaum, B., Shephard, G.: Aperiodic tiles. Discrete and Computational Geometry 8(1), 1–25 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ollinger, N. (2009). Tiling the Plane with a Fixed Number of Polyominoes. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)