Fixed Parameter Undecidability for Wang Tilesets

  title={Fixed Parameter Undecidability for Wang Tilesets},
  author={Emmanuel Jeandel and Nicolas Rolin},
  booktitle={AUTOMATA \& JAC},
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the tiling problem remains undecidable if the difference between the number of tiles and the number of colors is bounded by 43. One of the main new tool is the concept of Wang bars, which are equivalently inflated Wang tiles or thin polyominoes. 

Domino Problem Under Horizontal Constraints

The Domino Problem on Z 2 asks if it is possible to tile the plane with a given set of Wang tiles; it is a classical decision problem which is known to be undecidable. The purpose of this article is

Parametrization by Horizontal Constraints in the Study of Algorithmic Properties of $\mathbb{Z}^2$-Subshift of Finite Type

The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of Z -subshifts of finite type are standard problems of symbolic dynamics. In this article we study

An aperiodic set of 11 Wang tiles

A new aperiodic tile set containing 11 Wang tiles on 4 colors is presented. This tile set is minimal in the sense that no Wang set with less than 11 tiles is aperiodic, and no Wang set with less than

Dynamique symbolique sur des groupes : une approche informatique. (Symbolics dynamics on groups: a computer scientist approach)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and

An Improved Algorithm for Image Synthesis based on Gradient and Database

An improved algorithm base on Image Quilting is proposed that reduces the distortion and time for generating high quality images effectively and improves the way of texture blocks selecting.



Tiling the Plane with a Fixed Number of Polyominoes

It is proved that the problem remains undecidable if the set of instances is restricted to sets of 5 polyominoes, and in the case of tiling by translations only, the problem is Undecidable for sets of 11 polyominees.

An aperiodic set of 13 Wang tiles

Tilings and Quasiperiodicity

A small aperiodic set of Wang tiles

The undecidability of the domino problem

A way to break the boredom in reading is choosing undecidability of the domino problem as the reading material.

Proving theorems by pattern recognition — II

Theoretical questions concerning the possibilities of proving theorems by machines are considered here from the viewpoint that emphasizes the underlying logic. A proof procedure for the predicate

Proving theorems by pattern recognition I

It now appears that as more progress is made, strategies in the search for proofs, or what are often called heuristic methods, will also gradually become part of the subject matter of inferential analysis.