Weak Separation and Plabic Graphs

Details Weak Separation and Plabic Graphs Weak Separation and Plabic Graphs

2011-09-20

arxiv.org/abs/1109.4434v1

Mathematics

Combinatorics

Scientific paper

Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal by inclusion weakly separated collections of minors have the same cardinality, and that they can be related to each other by a sequence of mutations. On the other hand, Postnikov studied total positivity on the Grassmannian. He described a stratification of the totally nonnegative Grassmannian into positroid strata, and constructed their parametrization using plabic graphs. In this paper we link the study of weak separation to plabeic 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.

Affiliated with

Also associated with

No associations

Rating

Weak Separation and Plabic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weak Separation and Plabic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak Separation and Plabic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256769