13:00
Fersztand, Jacquard, Nanda, and Tilmann ('24) introduced the Skyscraper Invariant, a filtration of the classical rank-invariant, for multiparameter persistence modules. It is defined by considering the Harder-Narasimhan (HN) filtration of the module along a special set of stability conditions.
This talk will begin with a post-hoc motivation for considering stability conditions on persistence modules. To compute an approximation of the Skyscraper Invariant we present a technique which, exploiting the geometry of low-dimensional bifiltrations, lets us perform a brute-force computation. We compare it against Cheng's algorithm [Cheng24] which can compute HN filtrations of arbitrary acyclic quiver representations in polynomial time in the total dimension.
To avoid unnecessary recomputation in our algorithm, we ask for which stability conditions the HN filtrations are equivalent. This partition of the space of stabililty conditions is called the wall-and-chamber structure. We show that for a finitely presented d-parameter module it is given by the lower envelopes of a set of multilinear polynomials of degree d-1. For d=2 it is then easy to compute this, enabling a faster algorithm to compute the Skyscraper Invariant up to arbitrary accuracy. As a proof of concept for data analysis, we use it to compute a filtered version of the Multiparameter Landscape for large modules from real world data.