Algorithms for translational tiling

From MaRDI portal



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 ZN. In particular we carry out a full classification of all non-periodic tilings of Z144.











This page was built for publication: Algorithms for translational tiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391792)