6 problems

Gauge-removal conjecture. In this situation, it should be possible to use the extra gauge freedom of the weights on the reducible network to obtain nonzero edge vectors.

Let the PBDTP graph $\mathcal G$ represent the irreducible positroid cell $\mathcal S_{\mathcal M}^{\text{\tiny TNN}}\subset Gr^{\text{\tiny TNN}}(k,n)$, and suppose every edge lie…

Let a bipartite graph be equipped with edge weights and formal half-edge variables $z_{U,e}$ satisfying the edge-weight, edge-compatibility, white-vertex, and black-vertex relation…

Let a PBDTP network be a reducible oriented planar network representing a point in an irreducible positroid cell, and suppose that each edge lies on a directed path to the boundary…

Fix a reduced PBDTP graph $\mathcal G$ representing the $|D|$-dimensional irreducible positroid cell…

Let $({\mathcal N},\mathcal O,\mathfrak l)$ be a reducible PBDTP network representing a point…