Decision problems on geometric tilings. Wang potatoes and finite local complexity

DOI10.1016/J.TCS.2026.115756MaRDI QIDQ6851450zbMATH OpenFDO

Authors Benjamin Hellouin de Menibus, Victor H. Lutfalla, Pascal Vanier

Publication date 27 February 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115756

zbMATH Keywords

decision problemdomino problemtilings subshiftsundecidability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
• About the domino problem for subshifts on groups
• An aperiodic monotile
• An introduction to symbolic dynamics and coding
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
• Graph subshifts
• scientific article; zbMATH DE number 5358070 (Why is no real title available?)
• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 2158946 (Why is no real title available?)
• On the Undecidability of the Tiling Problem
• Remarks on Berger's paper on the domino problem
• Rigidity of planar tilings
• The domino problem for self-similar structures
• The domino problem of the hyperbolic plane is undecidable
• The large scale geometry of strongly aperiodic subshifts of finite type
• The undecidability of the domino problem
• The undecidability of the domino problem
• Tiling a polygon with parallelograms
• Tilings with infinite local complexity
• Undecidability and nonperiodicity for tilings of the plane
• Weak colored local rules for planar tilings

Cited in

(1)

• A general framework for quasi-isometries in symbolic dynamics beyond groups

This page was built for publication: Decision problems on geometric tilings. Wang potatoes and finite local complexity

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