# Topology Seminar

## Topological complexity of graph configuration spaces

Steve Schierer, Lehigh University

Friday, February 2nd, 2018
1:00 PM - 2:00 PM
Hylan 1106A

The topological complexity of a path-connected space $X,$ denoted by $\mathrm{TC}(X),$ is an integer which can be thought of as the minimum number of continuous “rules” required to describe how to move between any two points of $X.$ We will consider the case in which $X$ is a space of configurations of $n$ points on a graph $\Gamma.$ This space can be viewed as the space of configurations of $n$ robots which move along a system of one-dimensional tracks. We will recall Farley and Sabalka’s approach to studying these spaces using discrete Morse theory and discuss how this can be used to determine the topological complexity.

There will be a pre-talk at 10:30 in Hylan 1101 on discrete Morse theory and topological complexity.

Event contact: evidaurr at ur dot rochester dot edu