Counting tilings of the $n\times m$ grid, cylinder, and torus

Abstract

We count tilings of the $n\times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework for understanding a family of counting problems, expanding on the work by Ethier and Lee counting tilings of the torus by tiles of two colors.

arXiv comment74 pages, 83 figures