An aperiodic set of 11 Wang tiles
Discrete Mathematics
2021-01-12 v4 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1506.06492,
title = {An aperiodic set of 11 Wang tiles},
author = {Emmanuel Jeandel and Michael Rao},
journal= {arXiv preprint arXiv:1506.06492},
year = {2021}
}