Algorithms for translational tiling - Mathematics > Number TheoryReportar como inadecuado




Algorithms for translational tiling - Mathematics > Number Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: In this paper we study algorithms for tiling problems. We show that theconditions $T1$ and $T2$ of Coven and Meyerowitz, conjectured to benecessary and sufficient for a finite set $A$ to tile the integers, can bechecked in time polynomial in ${diam}A$. We also give heuristic algorithms tofind all non-periodic tilings of a cyclic group $Z N$. In particular we carryout a full classification of all non-periodic tilings of $Z {144}$.



Autor: Mihail N. Kolountzakis, Mate Matolcsi

Fuente: https://arxiv.org/







Documentos relacionados