Proceedings of the London Mathematical Society · 2016 · 17 citations · 8 references
Natural SciencesMathematicsDiscrete MathematicsCombinatorial Set TheoryTiling ProblemsTiling Theory
Let T be a tile in Z n , meaning a finite subset of Z n . It may or may not tile Z n , in the sense of Z n having a partition into copies of T. However, we prove that T does tile Z d for some d. This resolves a conjecture of Chalcraft.
8
Solomon W. Golomb, Branko Grünbaum, G. C. Shephard · American Mathematical Monthly · 1988 · 1.4K citations
The undecidability of the domino problem
Robert E. Berger · Memoirs of the American Mathematical Society · 1966 · 974 citations
Tiling with sets of polyominoes
Solomon W. Golomb · Journal of Combinatorial Theory · 1970 · 75 citations
Solomon W. Golomb · Journal of Combinatorial Theory · 1966 · 71 citations