Daniel Tubbenhauer: Three colors suffice
A late 20th birthday-present for Lewis Carroll. This is a talk he gave a few days ago at USC. The Temperley-Lieb algebra gives an amazing constructive proof which actually counts 3-colorings. It's an evaluation/reduction process. They were doing this the same year John Reynolds gave his tutorial “the application of the lambda calculus to programming languages”. See Definitional Interpreters Revisted.
Subscribe to Daniel Tubbenhauer.
Comments
Post a Comment