Mathematics & Statistics Graduate Student Seminar: tilings, aperiodic tilings, and undecidability
Hi, everyone,
听
The Mathematics & Statistics Graduate Student Seminar will convene again this week at 1:00pm on Friday, March 15, in the Main Lounge (Burnside 1025). As usual, there will be pizza.
听
This week, Florestan Brunck will talk to us about :
听
Given finitely many different types of tiles in the plane, each in infinite supply, can we juxtapose them in such a way that they cover the entire plane without gaps? This problem is known as the tiling problem and turns out to be unexpectedly difficult 鈥� difficult enough that no algorithm can answer this question for us, even for very simple families of tilings. The proof of the undecidability of the tiling problem is a nifty reduction argument. More surprising perhaps is the fact that the undecidability of the tiling problem implies the existence of aperiodic tilings, which tesselate the plane only aperiodically. This talk will consist of the proof of the undecidability of the constrained tiling problem, together with a mosaic of interesting facts about aperiodic tilings, and in particular Penrose tilings.
听
See you all there!
听
All graduate students are invited. As with all talks in the graduate student seminar, this talk will be accessible to all graduate students in math and stats. This seminar was made possible by funding from the 9I制作厂免费 Mathematics and Statistics Department and PGSS.