Fractional Tans, Part 2: Grid

As promised in Part 1, here’s a post on polyforms made from half-weight tans on the tetrakis square grid. The pieces with three and four of these collectively have weight·area 16, so we get to continue our run of square tilings. We can notate this set as {3, 4}·½ ◢. (This use of braces is a new addition to my notation, but is intuitive enough, I think.) Here are the pieces:

It can be challenging to pick the pieces out from this image of the 4×4 tiling, but they are all in here, I promise:

There are, in fact, two different n×n subgrids of the tetrakis square grid for even n. If we overlay the two subgrids as shown, we get a grid where all four orientations of a tan within a square cell are present:

This grid (as extended to the plane) has the property of being “noble”, that is, all vertices and all tiles are equivalent. The tetrakis square grid itself is not noble, as there are two different kinds of vertices. (Even though this grid looks like a tetrakis grid, the points where diagonals intersect are not vertices.) The subset of the n·½ ◣ without any half-tans in coinciding positions will fit on the melded grid. The {1, 2, 3}·½ ◣ with this property can tile a 3×3 square:

There is a (perhaps surprising) link between polytans in this grid and polykings. Consider the graph made by joining connected tiles in the melded tetrakis square grid:

These connections are a subset of the ones possessed by the graph moves a king can make on the regular square grid.. We can represent the missing connections by adding voids at certain corners. Then we can tile the “{1, 2, 3}-kings” on this grid:

This tiling is equivalent to the previous one. It loses some elegance by not using a noble tiling, but it certainly gains legibility! One advantage to this format is that I could use it directly in Polysolver. The other tilings in this half-tan miniseries, (excepting the one Bryce Herdt found in the previous post) I found manually, with some tedium.

And that’s all I’ve got on poly-half-tans! As an aside, nobility has been in the news recently. Connor Hill recently proved that there are exactly 146 noble polyhedra, plus a few infinite families. His paper is here, and there was also a good Numberphile video on the topic. I don’t know if the noble multiple euclidean planar tilings have been similarly characterized, but they would make an exciting vein for polyform exploration.

Fractional Tans, Part 1: Glom

I left polytans out of my post about polyforms with fractional weight cells. They behave a little weirdly, and deserved their own post. Which is this one! But first, a notation consideration. Previously, I made the distinction between glom polytans, where tans can be placed in arbitrary orientation as they are glommed onto another tan, and grid polytans, where tans are constrained to the tetrakis square grid. Both of these polytan types seem important enough for my notation system to capture. Luckily, Unicode provides us with more than one right triangle. So, we’ll give the glom polytans “◣”, because that triangle stands to the left, and let the grid polytans have “◢”, which stands to the right.

That out of the way, we’ll focus on glom polytans in the current post. When I described how to make polyforms from fractional weight cells, I allowed the cells to stack entirely on top of other cells as well as to be placed adjacent to other cells. With polytans, there is another possibility. Here are the pieces that I consider to properly constitute 3·½◣:

Above, areas where two half-tans overlap are shown in a darker shade. The first two rows contain well behaved pieces, but in the third row, there are half-tans with partial overlap. We can make these by loosening our rule of how glomming works. It becomes:

  1. Select an edge of a cell.
  2. Place another cell on either side of that edge such that an edge of the new cell entirely coincides with the selected edge, and at no point does the entire weight of cells present exceed 1.

I’ll grant that n·½◣ tans containing partial overlaps look a little weird, and one could reasonably choose to exclude them. I have chosen not to do so in part because if you start with a larger set you can make a subset with desired properties by filtering out undesirables, but if you start with the smaller one, you can’t recover the larger. Anyway, 12 3·½◣ have enough area·weight to fill a 3×3 square. Bryce Herdt found this piling:

If the pieces with partially overlapping tans are removed, the remaining 3·½◣ have area·weight 6, but throwing in the three 2·½◣ restores our ability to fill a square. Here’s a {2,3}·½◣ piling of a 2√2×2√2 square:

A non-trivial tiling problem in a 3×3 square may have seemed unlikely enough, but leave it to the fractional tans to inhabit one in an even smaller square! As the title of this post suggests, I intend to write another post about fractional grid polytans sometime soon. I also have a bunch more to write about my notation scheme. Hopefully I can finish that off before the decade is out, but I might have to work on blogging more prolifically for that to happen.

[Continued in Part 2]