Connectivity conjecture for maximal weakly separated collections
Let be the set of maximal collections of pairwise weakly separated -subsets of , and let a -move replace one of the two indicated members of a maximal collection by the other while preserving weak separability and maximality. Connectivity conjecture. For any collections , there is a sequence of -moves transforming into .
References
Status
- Solved: Suho Oh, Alexander Postnikov, and David E. Speyer. Weakly separated collections and plabic graphs (Proceedings of the London Mathematical Society, 2015) https://arxiv.org/abs/1109.4434
Source: Joshua S. Scott, “Quasi-Commuting Families of Quantum Minors”, arXiv:math/0008100 (2000).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.