betaFeedback

WorksMathematics

Tilings of integer sets of prime-power cardinality

Abstract

Let AA be a finite integer tile of cardinality pkp^k, where pp is prime and k≥1k\geq1. We first determine all possible fundamental periods of tilings of AA. A cyclotomic argument gives a common period PDPD, where PP is a power of pp and DD is a greatest common divisor of normalized differences in AA. Each PdPd with d∣Dd\mid D occurs as a fundamental period. At modulus PdPd, 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 PdPd, we classify their partitions into translates modulo PdPd 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.

Paper details

vlnc:W_bcukq7p5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

DeepSeek (multiple versions), Doubao, ChatGPT 6

View statement
Looking for related papers…