A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
From MaRDI portal
Publication:2268866
DOI10.1016/j.tcs.2009.11.018zbMath1182.03072OpenAlexW2010002333MaRDI QIDQ2268866
Publication date: 9 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.018
aperiodic tilingcompletion problemdomino problemtiling problemaperiodic sets of tilesstrong aperiodicity
Undecidability and degrees of sets of sentences (03D35) Cellular automata (computational aspects) (68Q80) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items
About the Domino Problem for Subshifts on Groups ⋮ An upper bound on the growth of Dirichlet tilings of hyperbolic spaces ⋮ Unnamed Item ⋮ A strongly aperiodic shift of finite type on the discrete Heisenberg group using Robinson tilings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strongly aperiodic set of tiles in the hyperbolic plane
- The domino problem of the hyperbolic plane is undecidable
- Regular production systems and triangle tilings
- A small aperiodic set of Wang tiles
- Matching rules and substitution tilings
- Aperiodic tiles
- Undecidable tiling problems in the hyperbolic plane
- Aperiodic tilings of the hyperbolic plane by convex polygons
- A small aperiodic set of planar tiles
- The pinwheel tilings of the plane
- Aperiodic tilings
- Tilings, substitution systems and dynamical systems generated by them
- Hyperbolic regular polygons with notched edges
- Undecidability and nonperiodicity for tilings of the plane
- The Tiling Problem Revisited (Extended Abstract)
- The undecidability of the domino problem
- NP problems are tractable in the space of cellular automata in the hyperbolic plane