Algorithms for translational tiling

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-697605

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.