Course offered at UFMG in 2020/2 (remotely)
Classes on Mondays and Wednesdays, at 9h25
Assignment 1 (due
December 28th January 4th)
Assignment 2 (due
January 15th January 22nd)
Assignment 3 (due February 19th)
Final project topics
About the course
Whenever you stir coffee in a mug, there is always a point not moving. At the same time, there are always at least two antipodal points on Earth’s Equator with the same temperature.
What do these things have to do with colouring vertices in a graph or finding the equilibria of some games? Join this course and we will explore applications and connections of some classical results in algebraic topology to combinatorics and to game theory.
Not to be confused with a course on Topological Graph Theory. No graphs will be drawn in this course.
Fixed point type of results and applications to combinatorics and game theory. Other topological methods, such as Scarf’s Lemma and Tucker’s Lemma.
Simplicial complexes. Triangulations. Spheres and boundaries. Sperner’s Lemma. Independence complex of a graph. Theorems of Hall and Konig to hypergraphs. Brouwer’s fixed point theorem. Applications to game theory and Nash Equilibrium. Scarf’s Lemma and applications to combinatorics and games. Tucker’s Lemma and Borsuk-Ulam Theorem. Colouring Kneser Graphs.
70 points on assignments. A final project worth 30 points, that involves reading and presenting a research paper.
Penny Haxell’s course notes