scholarly journals Arrangements of equal minors in the positive Grassmannian

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Miriam Farber ◽  
Alexander Postnikov

International audience We discuss arrangements of equal minors in totally positive matrices. More precisely, we would like to investigate the structure of possible equalities and inequalities between the minors. We show that arrangements of equals minors of largest value are in bijection with <i>sorted sets</i>, which earlier appeared in the context of <i>alcoved polytopes</i> and Gröbner bases. Maximal arrangements of this form correspond to simplices of the alcoved triangulation of the hypersimplex; and the number of such arrangements equals the <i>Eulerian number</i>. On the other hand, we conjecture and prove in many cases that arrangements of equal minors of smallest value are exactly the <i>weakly separated sets</i>. Weakly separated sets, originally introduced by Leclerc and Zelevinsky, are closely related to the \textitpositive Grassmannian and the associated <i>cluster algebra</i>.

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Miriam Farber ◽  
Pavel Galashin

International audience Following the proof of the purity conjecture for weakly separated sets, recent years have revealed a variety of wider classes of pure domains in different settings. In this paper we show the purity for domains consisting of sets that are weakly separated from a pair of “generic” sets I and J. Our proof also gives a simple formula for the rank of these domains in terms of I and J. This is a new instance of the purity phenomenon which essentially differs from all previously known pure domains. We apply our result to calculate the cluster distance and to give lower bounds on the mutation distance between cluster variables in the cluster algebra structure on the coordinate ring of the Grassmannian. Using a linear projection that relates weak separation to the octahedron recurrence, we also find the exact mutation distances and cluster distances for a family of cluster variables.


2019 ◽  
Vol 74 (4) ◽  
Author(s):  
Roksana Słowik

Abstract We propose the characterization of 3-dimensional Riordan arrays with use of three sequences that is analogous to the representation of 2-dimensional Riordan arrays with use of A and Z-sequence. We also suggest an application of this representation for finding totally positive matrices.


Sign in / Sign up

Export Citation Format

Share Document