Title: The Complexity of Multi-parameter Persistent Homology
Speaker: Magnus Botnan (Technische Universität München)
Abstract: It is widely known that multi-parameter persistent homology is a lot more "complicated" than the single-parameter setting. In this talk I will discuss in what sense it is more complicated from the point of view of representation theory, and from the point of view of algorithms. The talk will only assume elementary knowledge of linear algebra.