Session leader: Tom Davis
Session topic: Coloring
Coloring is a mathematical technique that can be used in a large variety of mathematical problems where imagining an assignment of colors to some feature of the problem makes the result obvious. Perhaps the best known example is a proof that it is impossible to place 31 non-overlapping dominoes on a chessboard where two opposite corners have been cut off. If we consider the standard coloring of a chessboard with two (say white) corners are removed, there remain 32 black and 30 white squares to cover. Each domino covers one black and one white square so at most 30 dominoes can be placed and two black squares somewhere must remain uncovered.
About the Leader:
Tom Davis is a mathematician gone bad. Although he received a perfectly good education in pure mathematics, he spent most of his career applying and mis-applying that training to the black art of computer graphics hardware and software design. His education has not been completely wasted since he has spent some time teaching traditional mathematics and computer science courses at various colleges and universities.