Ribbon Tile Invariants, part I:
Domino and Tromino Tilings

Igor Pak

MIT

October 4,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

I will present two amazing results in what seem to be elementary combinatorics. The first is the Thurston's linear time algorithm for testing whether a region is tileable by dominoes. The second is the Conway-Lagarias invariant for trominoes (along with the tileability criteria). An attempt will be made to lose all the advanced mumbo jumbo (which apparently motivated the authors), and give a complete proof in simple combinatorial terms, accessible to all undergraduates.


Speaker's Contact Info: pak(at-sign)math.mit.edu.zzz - delete .zzz


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on September 28, 2000 at 11:03 AM. Copyright © 1998-99, Sara C. Billey. All rights reserved.