14 problems
Subdivided-sweep conjecture. There is a faster way to compute all cokernels of for in one sweep, with runtime in , rather than calling the…
The generalized persistence diagram and the spread-Euler characteristic are invariants associated with finitely presented multiparameter persistence representations; on a fixed spr…
Bjerkevik's conjecture. On persistence modules of bounded pointwise dimension, the pruning distance is stable and Lipschitz equivalent to the interleaving distance. More precisely,…
Let be a multiparameter persistence module and let an -pruning be its decomposable approximation obtained by discarding features below scale . Bjerkevik…
Finiteness conjecture. Under generic conditions on the input pair , this special subset of is finite.
Finiteness conjecture. The set
Let be an odd integer, and let be a compatible-inclusion problem, with its -weakening defined by retaining directed edges represented by paths of length at mos…
Let and be upset decomposable persistence modules, where an upset decomposable module is a direct sum of upset modules. The upset matching conjecture. There is a constant…
Let a persistence module be given in the computational setting of the paper, and let its pruning be the invariant defined there. The polynomial-time pruning conjecture. Computing p…
Let and be persistence modules that are -interleaved, with . Let … Here is the relevant neighborhood of defined in the paper, and an…
Let and be pfd persistence modules, and let denote the pruning distance and the interleaving distance. Write . The pruning-dist…
Cubic Betti-number bound. We have
Let be fixed, and consider -parameter persistence modules equipped with the relevant distance and interleaving distance. The paper notes that the 1-Lipschitz stability…
Let be fixed, and let and denote the corresponding distances on finitely presented -parameter persistence modules, with…