An aperiodic set of 11 Wang tiles
From MaRDI portal
Publication:5162865
Abstract: We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or fewer than 4 colors is aperiodic. This gives a definitive answer to the problem raised by Wang in 1961.
Recommendations
Cites work
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 3657754 (Why is no real title available?)
- scientific article; zbMATH DE number 768067 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3325557 (Why is no real title available?)
- scientific article; zbMATH DE number 3349794 (Why is no real title available?)
- A small aperiodic set of Wang tiles
- An aperiodic set of 13 Wang tiles
- CCS expressions, finite state processes, and three problems of equivalence
- Combinatorics and topology of the Robinson tiling
- Deterministic aperiodic tile sets
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
- Fixed Point and Aperiodic Tilings
- Fixed parameter undecidability for Wang tilesets
- Fixed-point tile sets and their applications
- Foundation for a series of efficient simulation algorithms
- Linear sampling and the ∀∃∀ case of the decision problem
- Local rules and global order, or aperiodic tilings
- Matching rules and substitution tilings
- Nonemptiness problems of Wang tiles with three colors
- Notes on a class of tiling problems
- Putting the Pieces Together: Understanding Robinson's Nonperiodic Tilings
- Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
- Reducing NFAs by invariant equivalences.
- Simple bisimilarity minimization in \(O(m \log n)\) time
- Some properties of the singular words of the Fibonacci word
- Substitutions and strongly deterministic tilesets
- The 4-way deterministic tiling problem is undecidable
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The undecidability of the domino problem
- Three Partition Refinement Algorithms
- Tilings, substitution systems and dynamical systems generated by them
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(30)- Necessary conditions for tiling finitely generated amenable groups
- Tiling the plane with a set of ten polyominoes
- A self-similar aperiodic set of 19 Wang tiles
- Undecidable translational tilings with only two tiles, or one nonabelian tile
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
- Wang tiles: connectivity when tiling a plane
- Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type
- Nonexpansive directions in the Jeandel-Rao Wang shift
- A numeration system for Fibonacci-like Wang shifts
- Aperiodic SFTs on Baumslag-Solitar groups
- Substitutive structure of Jeandel-Rao aperiodic tilings
- A chiral aperiodic monotile
- An aperiodic monotile
- Cutting corners
- Rauzy induction of polygon partitions and toral \(\mathbb{Z}^2\)-rotations
- Automaton (semi)groups: Wang tilings and Schreier tries
- Packing unequal disks in the Euclidean plane
- Strongly aperiodic subshifts of finite type on hyperbolic groups
- Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems
- A generalization of the simulation theorem for semidirect products
- A strongly aperiodic shift of finite type on the discrete Heisenberg group using Robinson tilings
- scientific article; zbMATH DE number 1542853 (Why is no real title available?)
- A minimal subsystem of the Kari-Culik tilings
- Slopes of multidimensional subshifts
- Markov partitions for toral \(\mathbb{Z}^2\)-rotations featuring Jeandel-Rao Wang shift and model sets
- Aperiodic tilings and entropy
- Domino problem for pretty low complexity subshifts
- Aperiodic subshifts of finite type on groups which are not finitely generated
- The undecidability of the domino problem
- A linear algorithm for brick Wang tiling
This page was built for publication: An aperiodic set of 11 Wang tiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5162865)
