Fixed parameter undecidability for Wang tilesets

MaRDI QIDQ4986305zbMATH OpenFDO

Authors Emmanuel Jeandel, Nicolas Rolin

Publication date 27 April 2021

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

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Recommendations

• The 4-way deterministic tiling problem is undecidable
• Universal Tilings
• Tiling the Plane with a Fixed Number of Polyominoes
• On the Undecidability of the Tiling Problem
• scientific article; zbMATH DE number 1948487

Cited in

(9)

• The 4-way deterministic tiling problem is undecidable
• A linear algorithm for brick Wang tiling
• Universal Tilings
• scientific article; zbMATH DE number 1948487 (Why is no real title available?)
• scientific article; zbMATH DE number 2119689 (Why is no real title available?)
• Piecewise affine functions, Sturmian sequences and Wang tiles
• An aperiodic set of 11 Wang tiles
• Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type
• Rectangular tileability and complementary tileability are undecidable

This page was built for publication: Fixed parameter undecidability for Wang tilesets

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