2011
DOI: 10.1016/j.jcta.2009.10.006
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial formulas for -coordinates in a totally nonnegative Grassmannian

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
28
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(29 citation statements)
references
References 6 publications
1
28
0
Order By: Relevance
“…The cells are coded by combinatorial types of appropriate planar networks. K.Talaska [31] obtained further development and generalization of Postnikov's result.…”
Section: Resultsmentioning
confidence: 77%
“…The cells are coded by combinatorial types of appropriate planar networks. K.Talaska [31] obtained further development and generalization of Postnikov's result.…”
Section: Resultsmentioning
confidence: 77%
“…The connection between Postnikov's work and the ideal structure of A has recently been developed by Goodearl, Launois and Lenagan [7,8]. In view of this and the results of this paper, it is perhaps not surprising that Talaska [20] has independently been able to give an explicit description of the correspondence between Postnikov's L-diagram and totally-nonnegative-matrices using the classic version of Lindström's Lemma.…”
mentioning
confidence: 65%
“…Talaska provided a birational inverse to the boundary measurement map for any positroid when G is a Le‐diagram; her inverse was not formulated in terms of a twist map and seems unlikely to generalize to other reduced graphs.…”
Section: Introduction and Survey Of Resultsmentioning
confidence: 99%