arXiv · 0810.4338
Algorithms for translational tiling
Abstract
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time polynomial in ${diam}(A)$. We also give heuristic algorithms to find all non-periodic tilings of a cyclic group $Z_N$. In particular we carry out a full classification of all non-periodic tilings of $Z_{144}$.
Explore related subjects
Keep this discovery
Mihail N. Kolountzakis, Mate Matolcsi. 2008-10-23. Algorithms for translational tiling. https://arxiv.org/abs/0810.4338
Cite the original work for its findings. Save a collection to share your selection of sources.