Polopoly will be shut down December 15, 2023. Existing pages will have to be moved or will be removed at that date. Empolyees may read more at FAQ Polopoly Avveckling

MAI0126
Topological Combinatorics/
Topologisk kombinatorik

Number of credits: 8 hp

Examiner: Axel Hultman

Course literature: J. Matoušek, Using the Borsuk-Ulam Theorem, Springer, 2003. Freely downloadable material and handouts.

Course contents: Versions of the Borsuk-Ulam theorem with applications to combinatorics. Theory of simplicial and cellular complexes. Combinatorial methods (shellability, discrete Morse theory, nerve lemmas, fiber lemmas, etc.) for computing topological invariants. Classical examples of combinatorially defined cell complexes and their toplogical properties.

Organisation: Lectures.

Examination: Homework assignments. Literature project.

Prerequisites: Basic abstract algebra and discrete mathematics. Having taken a course in topology is desirable but not a strict requirement.

Course web page

Page manager: karin.johansson@liu.se
Last updated: 2022-11-15