Tiling the Plane with a Fixed Number of Polyominoes

  • Nicolas Ollinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5457)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Nicolas Ollinger
    • 1
  1. 1.Laboratoire d’informatique fondamentale de Marseille (LIF)Aix-Marseille Université, CNRSMarseilleFrance

Personalised recommendations