Skip to main content

A monomer-dimer tiling of a rectangular grid with $r$ rows and $c$ columns satisfies the \emph{tatami}tatami condition if no four tiles meet at any point. (orOr you can think of it as the removal of a matching from a grid graph that breaks all $4$-cycles).

A monomer-dimer tiling of a rectangular grid with $r$ rows and $c$ columns satisfies the \emph{tatami} condition if no four tiles meet at any point. (or you can think of it as the removal of a matching from a grid graph that breaks all $4$-cycles).

A monomer-dimer tiling of a rectangular grid with $r$ rows and $c$ columns satisfies the tatami condition if no four tiles meet at any point. (Or you can think of it as the removal of a matching from a grid graph that breaks all $4$-cycles).

Copied images to imgur.com, as they were not being displayed because of new https rule. Added links to original image sources.
Source Link

Monomer-Dimer tatami tilings need better relationships with other math. SummarySummary of results.

    A tatami tiling showing all possible features, up to rotation A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/bare_tatami_example.png(source)

    A tatami tiling showing all possible features, up to rotation A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/coloured_tatami_example.png(source)

    Loner and Vee features Loner and Vee features http://geoburst.ca/eggs/tatami/loner_vee.png(source)

    Bidimer and vortex features Bidimer and vortex features http://geoburst.ca/eggs/tatami/bidimer_vortex.png(source)

    Tomoku game.  Is it NP-hard? Tomoku game. Is it NP-hard? http://geoburst.ca/eggs/tatami/tomoku.png(source)

    Water striders.  Is it NP-hard? Water striders. Is it NP-hard? http://geoburst.ca/eggs/tatami/strider.png(source)

Our third paper in this story (in preparation), looks at the generating polynomial for $n\times n$ tilings with $n$ monomers whose coefficients are the number of tilings with exactly $v$ vertical dimers (or $h$ horizontal dimers). It turns out this generating polynomials is a product of cyclotomic polynomials, and a somewhat mysterious and seemingly irreducible polynomial, who's complex roots look like this:

    Complex roots of mysterious polynomial Complex roots of mysterious polynomial http://geoburst.ca/eggs/tatami/pn_roots.png(source)

Output of cat algorithm generating tilings.  This is genVH(8,7), for <span class=    Output of cat algorithm generating tilings.  This is genVH(8,7), for <span class=$8\times 8$ tilings with $8$ monomers and $7$ vertical dimers." /> (source)

Monomer-Dimer tatami tilings need better relationships with other math. Summary of results.

A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/bare_tatami_example.png

A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/coloured_tatami_example.png

Loner and Vee features http://geoburst.ca/eggs/tatami/loner_vee.png

Bidimer and vortex features http://geoburst.ca/eggs/tatami/bidimer_vortex.png

Tomoku game. Is it NP-hard? http://geoburst.ca/eggs/tatami/tomoku.png

Water striders. Is it NP-hard? http://geoburst.ca/eggs/tatami/strider.png

Our third paper in this story (in preparation), looks at the generating polynomial for $n\times n$ tilings with $n$ monomers whose coefficients are the number of tilings with exactly $v$ vertical dimers (or $h$ horizontal dimers). It turns out this generating polynomials is a product of cyclotomic polynomials, and a somewhat mysterious and seemingly irreducible polynomial, who's complex roots look like this: Complex roots of mysterious polynomial http://geoburst.ca/eggs/tatami/pn_roots.png

Output of cat algorithm generating tilings.  This is genVH(8,7), for <span class=$8\times 8$ tilings with $8$ monomers and $7$ vertical dimers." />

Monomer-Dimer tatami tilings need better relationships with other math. Summary of results

    A tatami tiling showing all possible features, up to rotation (source)

    A tatami tiling showing all possible features, up to rotation (source)

    Loner and Vee features (source)

    Bidimer and vortex features (source)

    Tomoku game.  Is it NP-hard? (source)

    Water striders.  Is it NP-hard? (source)

Our third paper in this story (in preparation), looks at the generating polynomial for $n\times n$ tilings with $n$ monomers whose coefficients are the number of tilings with exactly $v$ vertical dimers (or $h$ horizontal dimers). It turns out this generating polynomials is a product of cyclotomic polynomials, and a somewhat mysterious and seemingly irreducible polynomial, who's complex roots look like this:

    Complex roots of mysterious polynomial (source)

    Output of cat algorithm generating tilings.  This is genVH(8,7), for <span class=$8\times 8$ tilings with $8$ monomers and $7$ vertical dimers." /> (source)

Bounty Ended with no winning answer by Alejandro Erickson
Bounty Started worth 50 reputation by Alejandro Erickson
Source Link

Monomer-Dimer tatami tilings need better relationships with other math. Summary of results.

A monomer-dimer tiling of a rectangular grid with $r$ rows and $c$ columns satisfies the \emph{tatami} condition if no four tiles meet at any point. (or you can think of it as the removal of a matching from a grid graph that breaks all $4$-cycles).

This simple restriction, brought to my attention by Don Knuth in Vol 4 of TAOCP, became my PhD thesis topic, when my research group and I discovered that it imposes a aesthetically pleasing structure with a nice description, and opened up lots of fun questions.

Here is my favourite example, which has all of the possible "features". First it is shown uncoloured

A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/bare_tatami_example.png

And here it is coloured

A tatami tiling showing all possible features, up to rotation http://geoburst.ca/eggs/tatami/coloured_tatami_example.png

The magenta tiles show the types of features it can have, and here they are on their own:

Loner and Vee features http://geoburst.ca/eggs/tatami/loner_vee.png

Bidimer and vortex features http://geoburst.ca/eggs/tatami/bidimer_vortex.png

I'll introduce my question here, and then summarize some more results later. I want to find more and better ties between tatami tilings and other less esoteric math problems. If you think of a paper or subject I might want to look into, don't hesitate to answer.

In our first paper, we proved the above structure and showed that:

  1. A tiling is described by the tiles on its boundary, and hence has a description that is linear in the dimensions of the grid.
  2. The maximum number of monomers is at most max(r+1,c+1), and this is achievable.
  3. We found an algorithm for finding the rational generating polynomial of the numbers of tilings of height r (which I think can also be calculated with the transfer matrix method).

We posed a couple of complexity questions (which I am working on), for example, is it NP-hard to reconstruct a tatami tiling given its row and column projections?

Tomoku game. Is it NP-hard? http://geoburst.ca/eggs/tatami/tomoku.png

Or tile a given orthogonal region with no monomers?

Water striders. Is it NP-hard? http://geoburst.ca/eggs/tatami/strider.png

Next we focused on enumerating tilings of the $n\times n$ grid, and found a partition of $n\times n$ tiles with the maximum number of monomers into $n$ parts of size $2^{n-1}$. We also counted the number tilings with $k$ monomers, and this curious consequence:

The number of $n \times n$ tatami tilings is equal to the sum of the squares of all parts in all compositions of $n$. That is, $2^{n-1}(3n-4)+2$.

We also found an algorithm to generate the ones with $n$ monomers, and a Gray code of sorts.

Nice numbers, and a cute problem, but another paper that is self contained with elementary (albeit, somewhat complicated) reasoning.

Our third paper in this story (in preparation), looks at the generating polynomial for $n\times n$ tilings with $n$ monomers whose coefficients are the number of tilings with exactly $v$ vertical dimers (or $h$ horizontal dimers). It turns out this generating polynomials is a product of cyclotomic polynomials, and a somewhat mysterious and seemingly irreducible polynomial, who's complex roots look like this: Complex roots of mysterious polynomial http://geoburst.ca/eggs/tatami/pn_roots.png

We've found a bunch of neat stuff about it, for example the evaluation of this polynomial at $-1$ is $\binom{2n}{n}$, for $2(n+1)\times 2(n+1)$ tilings, and we found our generating polynomial gives an algorithm to generate the tilings in constant amortized time. Here is some output of the implementation:

Output of cat algorithm generating tilings.  This is genVH(8,7), for <span class=$8\times 8$ tilings with $8$ monomers and $7$ vertical dimers." />

That's the most of the published (and almost published) story. There is a loose connection with other monomer-dimer problems, and things I can look into, like Aztec tatami tilings, but I'm looking for direct applications of other results to these, or vice versa, especially with this last paper in preparation. I'm not asking you to do research for me, but just your thoughts as they are now, so I can go learn new stuff.

Feel free to comment about what you think is interesting, or not, about tatami tilings too!