An aperiodic set of 11 Wang tiles
From MaRDI portal
Publication:5162865
DOI10.19086/AIC.18614zbMATH Open1478.05020arXiv1506.06492OpenAlexW3118445680MaRDI QIDQ5162865FDOQ5162865
Authors: Emmanuel Jeandel, Michaël Rao 
Publication date: 5 November 2021
Published in: Advances in Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1506.06492
Recommendations
Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Cites Work
- Title not available (Why is that?)
- An aperiodic set of 13 Wang tiles
- Three Partition Refinement Algorithms
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Title not available (Why is that?)
- CCS expressions, finite state processes, and three problems of equivalence
- The undecidability of the domino problem
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
- Matching rules and substitution tilings
- Undecidability and nonperiodicity for tilings of the plane
- Combinatorics and topology of the Robinson tiling
- Tilings, substitution systems and dynamical systems generated by them
- Fixed Point and Aperiodic Tilings
- Fixed-point tile sets and their applications
- A small aperiodic set of Wang tiles
- Title not available (Why is that?)
- Some properties of the singular words of the Fibonacci word
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Title not available (Why is that?)
- Linear sampling and the ∀∃∀ case of the decision problem
- Notes on a class of tiling problems
- Reducing NFAs by invariant equivalences.
- Simple bisimilarity minimization in \(O(m \log n)\) time
- Local rules and global order, or aperiodic tilings
- Putting the Pieces Together: Understanding Robinson's Nonperiodic Tilings
- Deterministic aperiodic tile sets
- The 4-way deterministic tiling problem is undecidable
- Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
- Nonemptiness problems of Wang tiles with three colors
- Substitutions and strongly deterministic tilesets
- Title not available (Why is that?)
- Foundation for a series of efficient simulation algorithms
- Fixed parameter undecidability for Wang tilesets
- Title not available (Why is that?)
Cited In (30)
- Tiling the plane with a set of ten polyominoes
- Necessary conditions for tiling finitely generated amenable groups
- 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
- Packing unequal disks in the Euclidean plane
- Automaton (semi)groups: Wang tilings and Schreier tries
- Strongly aperiodic subshifts of finite type on hyperbolic groups
- A generalization of the simulation theorem for semidirect products
- Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems
- Title not available (Why is that?)
- A strongly aperiodic shift of finite type on the discrete Heisenberg group using Robinson tilings
- 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
- Aperiodic subshifts of finite type on groups which are not finitely generated
- The undecidability of the domino problem
- Domino problem for pretty low complexity subshifts
- 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)
