Periodicity of one-dimensional tilings

DOI10.1007/3-540-58265-7_14zbMath1384.05068OpenAlexW2143713110MaRDI QIDQ4637812

Vladimir Sidorenko

Publication date: 26 April 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58265-7_14

Mathematics Subject Classification ID

Other types of codes (94B60) Discrete geometry (52C99) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• On translating one polyomino to tile the plane
• Undecidability and nonperiodicity for tilings of the plane
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Theoretical Limitations on the Efficient Use of Parallel Memories
• The undecidability of the domino problem

This page was built for publication: Periodicity of one-dimensional tilings