no. 17 · Wednesday 18 November 2026
Tilings of integer sets of prime-power cardinality
Abstract
Let $A$ be a finite integer tile of cardinality $p^k$, where $p$ is prime and $k\geq1$. We first determine all possible fundamental periods of tilings of $A$. A cyclotomic argument gives a common period $PD$, where $P$ is a power of $p$ and $D$ is a greatest common divisor of normalized differences in $A$. Each $Pd$ with $d\mid D$ occurs as a fundamental period. At modulus $Pd$, a chain of greatest common divisors controls the compatibility of the Chinese remainder fibres. This yields independent digit functions and exact counts of the tilings. For tilings of fundamental period $Pd$, we classify their partitions into translates modulo $Pd$ and count the tilings that induce each partition. The same arithmetic data classify tiles with identical tiling families. Each class has a unique normalized tile of minimum diameter whose mask polynomial divides the masks of all normalized tiles in the class.
- fields
- Number Theory, Combinatorics