Quasi-periodic tiling with multiplicity: a lattice enumeration approach

Swee Hong Chan

The $k$-tiling problem for a convex polytope $P$ is the problem of covering ${\mathbb{R}}^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that eve…