Local rules for computable planar tilings

MaRDI QIDQ4986311zbMATH OpenFDO

Authors Thomas Fernique, Mathieu Sablik

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2759, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AUTOJAC2012.11

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Quasicrystals and aperiodic tilings in discrete geometry (52C23)

Abstract: Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question is to characterize, among a class of non-periodic tilings, the aperiodic ones. In this paper, we answer this question for the well-studied class of non-periodic tilings obtained by digitizing irrational vector spaces. Namely, we prove that such tilings are aperiodic if and only if the digitized vector spaces are computable.

Recommendations

• Quasiperiodicity and non-computability in tilings
• The undecidability of the domino problem
• Weak colored local rules for planar tilings
• When periodicities enforce aperiodicity
• Fixed Point and Aperiodic Tilings

Cited in

(9)

• Local rules for quasiperiodic tilings of quadratic 2-planes in \({\mathbb{R}{}}^ 4\)
• Local rules and global order, or aperiodic tilings
• The local theorem for monotypic tilings
• When periodicities enforce aperiodicity
• scientific article; zbMATH DE number 1445361 (Why is no real title available?)
• Weak colored local rules for planar tilings
• Ammann bars for octagonal tilings
• No weak local rules for the 4_p-fold tilings
• The uniform locally finite tilings of the plane

This page was built for publication: Local rules for computable planar tilings

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