Translational tilings: structure and decidability

Abstract: Let F be a finite subset of Z^d. We say that F is a translational tile of Z^d if it is possible to cover Z^d by translates of F with no overlaps. Given a finite subset F of Z^d, could we determine whether F is a translational tile in finite time? Suppose that F does tile, does it admit a periodic tiling? A well known argument of Wang shows that these two questions are closely related. In the talk, we will discuss the relation between periodicity and decidability; and present some new results, joint with Terence Tao, on the rigidity of tiling structures in Z^2, and their applications to decidability.

analysis of PDEsmetric geometryprobability

Audience: researchers in the topic

Online asymptotic geometric analysis seminar

Series comments: The link: technion.zoom.us/j/99202255210

If you are interested in giving a talk, please let one of the organizers know. Also, please suggest speakers which you would like to hear talk. Most talks are 50 minutes, but some 20-minute talks will be paired up as well. The talks will be video recorded conditioned upon the speakers' agreement.