WorksMathematics
Tilings of integer sets of prime-power cardinality
Abstract
Let be a finite integer tile of cardinality , where is prime and . We first determine all possible fundamental periods of tilings of . A cyclotomic argument gives a common period , where is a power of and is a greatest common divisor of normalized differences in . Each with occurs as a fundamental period. At modulus , 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 , we classify their partitions into translates modulo 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.