1 problem

Let $X_1,\ldots,X_m$ be persistence diagrams with only finitely many off-diagonal points. For a persistence diagram $Y$, define … For each optimal pairing from $W=\{w_j\}$ to $X_i$…