Arrangements of equal minors in the positive Grassmannian

zbMATH Open1393.15044arXiv1502.01434MaRDI QIDQ4584149FDOQ4584149

Publication date: 29 August 2018

Abstract: We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that arrangements of equal minors of largest value are in bijection with sorted sets, which earlier appeared in the context of alcoved polytopes and Gr"obner bases. Maximal arrangements of this form correspond to simplices of the alcoved triangulation of the hypersimplex; and the number of such arrangements equals the Eulerian number. On the other hand, we prove in many cases that arrangements of equal minors of smallest value are exactly weakly separated sets. Weakly separated sets, originally introduced by Leclerc and Zelevinsky, are closely related to the positive Grassmannian and the associated cluster algebra. However, we also construct examples of arrangements of smallest minors which are not weakly separated using chain reactions of mutations of plabic graphs.

Full work available at URL: https://arxiv.org/abs/1502.01434

zbMATH Keywords

triangulations Eulerian numbers Schur positivity cluster algebras plabic graphs alcoved polytopes hypersimplices matrix completion problem minors positive Grassmannian sorted sets thrackles totally positive matrices weakly separated sets Gröbner bases Plücker coordinates affine Coxeter arrangements

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48)

Cited In (1)

Weak separation, pure domains and cluster distance

This page was built for publication: Arrangements of equal minors in the positive Grassmannian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584149)