Algorithms for translational tiling

Details Algorithms for translational tiling Algorithms for translational tiling

2008-10-23

arxiv.org/abs/0810.4338v1

Mathematics

Number Theory

13 pages, 1 figure

Scientific paper

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}$.

Affiliated with

Also associated with

No associations

Rating

Algorithms for translational tiling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for translational tiling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for translational tiling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697605