Weak separation and plabic graphs
Author(s)Oh, S.; Speyer, D. E.; Postnikov, Alexander
MetadataShow full item record
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all inclusion-maximal weakly separated collections of minors have the same cardinality, and that they can be related to each other by a sequence of mutations. Postnikov studied total positivity on the Grassmannian. He described a stratification of the totally non-negative Grassmannian into positroid strata, and constructed theirparameterization using plabic graphs. In this paper, we link the study of weak separation to plabic graphs. We extend the notion of weak separation to positroids. We generalize the conjectures of Leclerc and Zelevinsky, and related ones of Scott, and prove them. We show that the maximal weakly separated collections in a positroid are in bijective correspondence with the plabic graphs. This correspondence allows us to use the combinatorial techniques of positroids and plabic graphs to prove the (generalized) purity and mutation connectedness conjectures.
DepartmentMassachusetts Institute of Technology. Department of Mathematics
Proceedings of the London Mathematical Society
Oxford University Press - London Mathematical Society
Oh, Suho, Alexander Postnikov, and David E. Speyer. “Weak Separation and Plabic Graphs.” Proceedings of the London Mathematical Society 110.3 (2015): 721–754.