2 problems

Bounded barcode-chain conjecture. There exists a number $M(n)$ such that for any $y_0,y_1\in\mathrm{MT}_n$, there exist $x_0,\ldots,x_k$ with $k<M(n)$, $y_0=x_0$, and $y_1=x_1$ sat…

Restricted interleaving metric conjecture. When $n=1,2$,