11:50 am, Lecture Hall 802
Lower Bounds for Topological Complexity
Tulsi Srinivasan
Azim Premji University.
03-10-19

---

Abstract

Topological complexity is generally hard to compute directly, and needs to be estimated via various lower and upper bounds. Lower bounds for LS-category, such as cup-length, category weight, the Toomer invariant and weak category, often naturally lead to lower bounds for topological complexity. In this talk, we will give a brief overview of these lower bounds, and the relationships between them.