An aperiodic set of 11 Wang tiles

Abstract

We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or fewer than 4 colors is aperiodic. This gives a definitive answer to the problem raised by Wang in 1961.

References in corpus (2)

• Combinatorial substitutions and sofic tilings
• Fixed Parameter Undecidability for Wang Tilesets

Cited by in corpus (10)

• An aperiodic monotile
• The minimal canonical form of a tensor network
• A guide to Penrose tilings
• Rauzy induction of polygon partitions and toral ${\mathbb{Z}}^2$-rotations
• A Numeration System for Fibonacci-like Wang Shifts
• Nonexpansive directions in the Jeandel-Rao Wang shift
• On bounded Wang tilings
• Aperiodic subshifts of finite type on groups which are not finitely generated
• Undecidability of Translational Tiling of the 3-dimensional Space with a Set of 6 Polycubes
• Undecidability of tiling the plane with a fixed number of Wang bars