When

Start: 11/06/2013 - 4:15pm

End : 11/06/2013 - 5:15pm

End : 11/06/2013 - 5:15pm

Category

Colloquium

Speaker

Igor Pak, University of California at Los Angeles

Abstract

Suppose we are given a finite set of tiles (think polyominoes). Can one use copies of these tiles to tile a given region? This problem is very hard in general, both mathematically and computationally, but special cases such as domino tilings are beautiful and well understood, with connections and applications from probability to commutative algebra to graph theory. The pioneering work by Conway, Lagarias, and Thurston, showed that for simply connected regions, the tileability problem is related and sometimes can be completely resolved via combinatorial group theory. In this talk I will give a broad survey of this approach and the state of art in generally. I will also mention few of my own recent results, notably some new hardness results (joint work with Jed Yang), and finish with some open problems.

Where

Davidson Lecture Hall, Claremont McKenna College

Attachment | Size |
---|---|

Pak.pdf | 102.79 KB |