Periodicity of one-dimensional tilings

DOI10.1007/3-540-58265-7_14MaRDI QIDQ4637812zbMATH OpenOpenAlexFDO

Authors V. R. 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

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

Recommendations

• Periodicity and decidability of tilings of \(\mathbb{Z}^2\)
• An aperiodic set of 13 Wang tiles
• Tiling the integers with aperiodic tiles
• The structure of translational tilings in \(\mathbb{Z}^d\)
• scientific article; zbMATH DE number 1101596

Cites work

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

Cited in

(6)

• Periodicity in one-dimensional peg duotaire
• Forcing nonperiodicity with a single tile
• Algebraic construction of one-dimensional quasiperiodic tilings
• Periodicity and decidability of tilings of \(\mathbb{Z}^2\)
• Undecidability of translational tiling of the 4-dimensional space with a set of 4 polyhypercubes
• Undecidability of translational tiling of the 3-dimensional space with a set of 6 polycubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637812)