Isohedral — the series
-
A tiling of the whole plane, decided on one tile's edge
Whether a shape tiles the plane is a question about an infinite object, and there is no procedure that answers it. There is a procedure that answers it *sometimes*, and it reads nothing but the shape's own boundary — a closed path of a few dozen steps, cut into six arcs. When the cut exists the tiling exists, and the cut names the group that makes it.
-
One shape, two kinds of tile
A tiling by copies of a single shape looks as though it must be homogeneous — every tile is congruent to every other, so what could distinguish them? The symmetry group can. There are shapes that tile the plane and admit no tiling whose group carries any tile to any other, and the smallest of them has eight cells.
-
One tile, two lattices, and a row that slides
A crystal chooses its lattice, and it is natural to think a tile does too. Among all polyominoes to thirteen cells, more than five hundred that are not rectangles lie on more than one lattice, and some on seven. They fall into at most two families, and a family is a row of copies that can slide against the next row, which is exactly what makes polytypes possible in a real crystal. A tile with a prime number of cells has no such row unless it is a bar, and so it lies on at most two lattices.