Weak separation and plabic graphs
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 b...
Main Authors: | Oh, S., Speyer, D. E., Postnikov, Alexander |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Oxford University Press - London Mathematical Society
2017
|
Online Access: | http://hdl.handle.net/1721.1/106463 https://orcid.org/0000-0002-3964-8870 |
Similar Items
-
Higher secondary polytopes and regular plabic graphs
by: Galashin, Pavel, et al.
Published: (2022) -
Flip cycles in plabic graphs
by: Balitskiy, Alexey, et al.
Published: (2021) -
Plabic graphs and zonotopal tilings
by: Galashin, Pavel
Published: (2022) -
Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
by: Kalman, Tamas, et al.
Published: (2018) -
A test for weakly separable preferences
by: Quah, J
Published: (2014)