Decidability and Periodicity of Low Complexity Tilings

Abstract

In this paper we study low-complexity colorings (or tilings) of the two-dimensional grid Z(2). A coloring is said to be of low complexity with respect to a rectangle if there exists m, n is an element of N such that there are no more than mn different rectangular m x n patterns in it. Open since it was stated in 1997, Nivat's conjecture states that such a coloring is necessarily periodic. Suppose we are given at most nm rectangular patterns of size n x m. If Nivat's conjecture is true, one can only build periodic colorings out of these patterns - meaning that if the m x n rectangular patterns of the coloring are among these mn patterns, it must be periodic. The main contribution of this paper proves that there exists at least one periodic coloring build from these patterns. We use this result to investigate the tiling problem, also known as the domino problem, which is well known to be undecidable in its full generality. However, we show that it is decidable in the low-complexity setting. Finally, we use our result to show that Nivat's conjecture holds for uniformly recurrent configurations. The results also extend to other convex shapes in place of the rectangle.