Classical results in algebraic topology have found very interesting applications in various fields of modern computer science. Many of these examples include lower-bounds or impossibility results, which are important parts of theoretical computer science research, yet often underrepresented in curricula. Moreover, since algebraic topology is not usually taught in computer science programs, these methods might remain inaccessible to students. The main goal of this course is to provide a sufficient theoretical foundation to understand and apply topological tools.

We will give an introduction to selected topological methods and demonstrate their versatility through applications in graph theory, discrete geometry and computational geometry.

Friday 8:45am–11:45am in room SG 1002 (Period 2)

Midterm exam + final exam

• Mónika Csikós
• Matěj Stehlík

English