The purity conjecture in type C
From MaRDI portal
Publication:2219302
Abstract: A collection of -element subsets of is weakly separated if for each , when the integers are arranged around in a circle, there is a chord separating from . Oh, Postnikov and Speyer constructed a correspondence between weakly separated collections which are maximal by inclusion and reduced plabic graphs, a class of networks defined by Postnikov which give coordinate charts on the Grassmannian of -planes in m-space. As a corollary, they proved Scott's Purity Conjecture, which states that a weakly separated collection is maximal by inclusion if and only if it is maximal by size. In this note, we describe maximal weakly separated collections corresponding to symmetric plabic graphs, which give coordinate charts on the Lagrangian Grassmannian, and prove a symmetric version of the Purity Conjecture.
Recommendations
Cites work
- Combinatorics of symmetric plabic graphs
- GRASSMANNIANS AND CLUSTER ALGEBRAS
- scientific article; zbMATH DE number 1126912 (Why is no real title available?)
- Positroid varieties: juggling and geometry
- Quasi-commuting families of quantum minors
- The twist for positroid varieties
- Total positivity for the Lagrangian Grassmannian
- Weak separation and plabic graphs
Cited in
(8)- Purity of critical cohomology and Kac's conjecture
- Cyclic sieving for plane partitions and symmetry
- Purity, algebraic compactness, direct sum decompositions, and representation type
- The purity of set-systems related to Grassmann necklaces
- Weak separation and plabic graphs
- Purity and Separation for Oriented Matroids
- Electrical networks and Lagrangian Grassmannians
- The purity phenomenon for symmetric separated set-systems
This page was built for publication: The purity conjecture in type \(C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219302)