Mathematical Aspect

Domino tilling

A domino tiling of a domain is a way to cover it with dominos without overlaps. For a given domain, there are only finitely many ways (possibly none at all) to cover is with dominos. We can pick one at random, giving the same probability to all of them. This is what we will always mean by a random domino tiling.

Tilings of an aztec diamond

The Aztec diamond of size n is this domain:

data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAJcAAACXCAMAAAAvQTlLAAAAWlBMVEX///8AAACmpqYiIiJkZGTh4eHm5ubHx8dzc3OhoaEeHh4YGBhubm5gYGBnZ2cTExOsrKyTk5Px8fFXV1eysrJMTExAQEAMDAwsLCzOzs5FRUV5eXmFhYWLi4tTB0NuAAACc0lEQVR4nO2c246rMAxFMfcGCLdSoMz8/28ORzovsfNAEFMZzV6PW5guUSO5aZQoOscw0hHG4eT9z5IZMi5JS23CMjLZp70qy6OOOh7Z6vNeDY9iinnUwOs/8AoDXmHAKwx4hQGvMOAVRmZSHnnmnPSX56+84DzbiSXrF32tLJvap6jML/TaDg3Nx9gu9Kqpf7j07St2k7immkevVtRRfakXf/p5cmiOTkTdxV68f7NE9L3nfUwTUQcveMELXvCCF7z+qFcp5pxMzjkeLyu8cirPSuRbzSgXslvpYOfFDcptooldVC6zZRdZWkp+++3YaF1cODQfozjo1eeZQ25pzV1W07Bk6KkfWNYYUUeW37w/7PXg0ebpr3N9n8vfHY/zXr6+P+sl+h5e8IIXvOAFL3jd3WvIOE8xf2X7/MWSwoxyjhJz22gKVrfPXyzZ657CYYhGU7mYf/sNGDMZlhia+UUVVafq9s8TDmNEZBuHdKKXTR3sQo2bpOOcsMS+6c3q0mQeWdLQwm/+oil1FSxRRIZ/s6vsE9lfuewv3/8KnnVf0V8xrTwyPi8FfQ8veMELXvCCF7zu5ZXw0DPnbMT3x579f3uQ63KeOSfZvdoudvmmmkcT9Szpqze7qKtFXfeuRB1NLNnrvnnU7l460fu8tPaX1vcRXvCCF7zgBS943dhLyXqh0vVVrevRWtfvJQr63gu84AUveMELXvC6tZeS/Zha969+mmNeWvdHe1Cxn9yD1v338IIXvOAFL3jB605eWs8H0HmegtbzJ7Se1yHRcb6JRO15MPAKAl5hwCsMeIUBrzDgFYZeL6Xn1So93/e3z0P+AbSuak7xZrpZAAAAAElFTkSuQmCC

The main idea is that, since we select one out of many tilings, the main step will involve counting tilings having a certain behavior. A domino has two squares, so a domain with an odd number of squares cannot be covered by dominos The domain is assumed to be drawn on a chess board. This explains the difference in colors between the dominos.

We got here an example of an aztec diamond with order 4 :

../_images/order4.png

The aztec diamond of order n got :

../_images/2puissance.png

A domino tiling is a complicated mathematical object. We would like to encode it into a simpler one. The height function is defined by a local rule: around a black square, turning counterclockwise, it increases by 1 along every edge, except when crossing a domino (in which case it decreases by 3).

One important remark: the height function on the boundary of a given domain does not depend on the tiling.

  • On the Aztec diamond, it looks like a jigsaw.

Take a sequence of domains of the same shape, but larger and larger. Then look at the height function generated by a random tiling of each one.

Theorem : The height function approaches a deterministic, well characterized shape (which depends on the domain shape).

On the arctic circle, the shape of the height function becomes interesting:
  • it is slanted in the corners;

  • and it is flat in the middle.

Shuffling algorithm

We will see how to randomly generate a tiling by getting a paving of size n from a paving of size n-1.

Cell 2*2 square :

../_images/cell22.png

-Destruction : if the active cell contains two dominoes, they are removed.

-Slip : if the active cell contains a domino, it is dragged.

-Create : if the active cell does not contain a domino, we flip a coin.

../_images/algo.png