2015
DOI: 10.1112/plms/pdu052
|View full text |Cite
|
Sign up to set email alerts
|

Weak separation and plabic graphs

Abstract: 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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
204
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 88 publications
(205 citation statements)
references
References 15 publications
1
204
0
Order By: Relevance
“…The combinatorial criterion for compatibility of Plücker coordinates is known as weak separation. It was conjectured by [48,58] and proved by [16,55]. As a first step towards Conjecture 8.10, it would be interesting to verify that for single column tableaux, ch(T )ch(T ′ ) = ch(T ∪ T ′ ) implies that P T and P T ′ are weakly separated.…”
Section: Lapid-mínguez's Criterionmentioning
confidence: 92%
“…The combinatorial criterion for compatibility of Plücker coordinates is known as weak separation. It was conjectured by [48,58] and proved by [16,55]. As a first step towards Conjecture 8.10, it would be interesting to verify that for single column tableaux, ch(T )ch(T ′ ) = ch(T ∪ T ′ ) implies that P T and P T ′ are weakly separated.…”
Section: Lapid-mínguez's Criterionmentioning
confidence: 92%
“…So all faces have labels of the same size. For the boundary faces, this is verified as a portion of [, Proposition 8.3. (1)].…”
Section: Strands and Postnikov Diagramsmentioning
confidence: 97%
“…The first of these statements was not proved yet. The second one is proved under assumption that the set of frozen variables is defined as Grassmann necklace corresponding to the permutation σ [23].…”
Section: Jhep04(2018)121mentioning
confidence: 99%
“…Every two clusters are connected by a sequence of mutations of this kind [23], hence C q [G m,n ] can be considered as poor man cluster algebra.…”
Section: Jhep04(2018)121mentioning
confidence: 99%
See 1 more Smart Citation