Packing dominoes and other shapes
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact .
Suppose we have a chessboard (of the usual 8by8 variety), and a supply of 32 dominoes (2by1 rectangles). It is a simple task to place the dominoes
so that they cover the whole board. But now suppose instead that we have 31 dominoes, and our task is to cover the chessboard with two opposite corners
removed. Can this be done?
This is an example of a `packing’ problem. Packings have given rise to some of the most beautiful and visual arguments in mathematics. In this talk we will consider some of the `classical’ theory and then move on to more recent results.
This talk is part of the Cambridge Philosophical Society series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
