Version 1: 30 pages, 8 figures. Version 2: 27 pages, 9 figures, results are now based on the notion of marker tiles which simplifies greatly the presentation while reducing its size. Version 3: fixed a typo in Figure 9
We define a Wang tile set $\mathcal{U}$ of cardinality 19 and show that the set $Ω_\mathcal{U}$ of all valid Wang tilings $\mathbb{Z}^2\to\mathcal{U}$ is self-similar, aperiodic and is a minimal subshift of $\mathcal{U}^{\mathbb{Z}^2}$. Thus $\mathcal{U}$ is the second smallest self-similar aperiodic Wang tile set known after Ammann's set of 16 Wang tiles. The proof is based on the unique composition property. We prove the existence of an expansive, primitive and recognizable $2$-dimensional morphism $ω:Ω_\mathcal{U}\toΩ_\mathcal{U}$ that is onto up to a shift. The proof of recognizability is done in two steps using at each step the same criteria (the existence of marker tiles) for proving the existence of a recognizable one-dimensional substitution that sends each tile either on a single tile or on a domino of two tiles.
R.伯杰同时证明了多米诺骨牌问题的不可判定性。事实证明,非周期瓦片集出现在许多主题中,从逻辑(Entscheidungsproblem)到物理(quasicrystals)。我们提出了一个新的非周期瓦片集,是基于Kleene的不动点结构,而不是几何参数的建设。这种构造类似于J·冯·诺依曼的自复制自动机; P. Gacs在纠错计算的上下文中也使用了类似的想法。这种构造是相当灵活的,因此它可以在许多方面使用:我们展示了如何使用它来实现替换规则,构造强非周期瓦片集(任何瓦片都远离任何周期瓦片),给出多米诺问题的不可判定性的新证明和相关结果,有效地刻画有限型二维移位的闭一维子移位项(改进了M. Hochman),构造仅具有复杂平铺的图块集合,以及构造不具有周期性(或接近周期性)平铺的“鲁棒的”非周期性图块集合,即使我们允许一些(足够稀疏的)平铺错误。对于后者,我们开发了一个层次分类的点随机集到不同等级的岛屿。最后,我们结合和修改我们的工具来证明我们的主要结果:存在一个瓦片集,使所有的平铺具有高的Kolmogorov复杂度,即使(足够稀疏)平铺错误是允许的。