Math 2.0

Convex and discrete geometry Example

Wang tile

Builds on Turing machineUndecidability of the halting problem

Example

A Wang tile is a unit square whose four edges carry colours from a finite set. Fix a finite set WW of Wang tiles. A tiling by WW is a map τ ⁣:ℤ2→W\tau \colon \Z^2 \to W such that adjacent edges match. That is, for each (i,j)(i, j), the right edge of τ(i,j)\tau(i, j) has the colour of the left edge of τ(i+1,j)\tau(i+1, j). Also the top edge of τ(i,j)\tau(i, j) has the colour of the bottom edge of τ(i,j+1)\tau(i, j+1). Tiles may not be rotated or reflected.

The set of all tilings by WW is a two-dimensional subshift of finite type in Wℤ2W^{\Z^2}. Indeed, its forbidden patterns are the pairs of adjacent tiles whose common edge has two different colours. There are finitely many of them.

Check of a small case: let WW consist of one tile whose four edges all have the colour aa. All matching conditions hold, so the constant map is a tiling, and it is periodic. Now let WW consist of one tile with left edge aa and right edge b≠ab \ne a. Two such tiles can never sit side by side, so WW admits no tiling.

Remarks

The domino problem asks for an algorithm that decides, given WW, whether WW tiles the plane. Berger proved that no such algorithm exists, by simulating a Turing machine with Wang tiles and reducing to the halting problem. A key step is the existence of an aperiodic set of Wang tiles: a set that tiles the plane, but only in non-periodic ways. Jeandel and Rao found an aperiodic set of 1111 Wang tiles and showed that no set with fewer tiles is aperiodic.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Computable set concept
  2. Function concept
  3. Gödel numbering concept
  4. Set concept
  5. Turing machine concept
  6. Turing machine definition
  7. Undecidability of the halting problem statement
  8. Wang tile example

Further reading

  1. Web https://en.wikipedia.org/wiki/Wang_tile
About this page
TagBBYNPDWR5R
URIm2://BBYNPDWR5R
Kindexample
WritingW0 stub
MSC52C20, 05B45, 37B51
IllustratesSubshift of finite type
UsesTuring machine, Undecidability of the halting problem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.