Algorithms for translational tiling
| dc.creator | Kolountzakis, Mihail N. | |
| dc.creator | Matolcsi, Mate | |
| dc.date | 2008-10-23 | |
| dc.date.accessioned | 2026-07-07T10:12:58Z | |
| dc.date.available | 2026-07-07T10:12:58Z | |
| dc.description | 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}$. | |
| dc.description | 13 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0810.4338 | |
| dc.identifier | http://arxiv.org/abs/0810.4338 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/172366 | |
| dc.subject | Number Theory | |
| dc.subject | 05B45; 43A25; 68W30; 68T20 | |
| dc.title | Algorithms for translational tiling | |
| dc.type | text |