Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Arrangements of equal minors in the positive Grassmannian

Arrangements of equal minors in the positive Grassmannian

Thumbnail Image
Download
Name

Postnikov_Arrangements.pdf

Size

589.65 KB

Format

Adobe PDF

Checksum (MD5)

e5490fb89ad044a715a4fff4d93e281f

Download all files submitted through automated deposit
sword-2018-09-25.original.zip (549.72 KB)
Author(s)
Farber, Miriam
•
Postnikov, Alexander
Date Issued
March 2016
Journal
Advances in Mathematics
Publisher
Elsevier BV
Citation
Farber, Miriam, and Alexander Postnikov. “Arrangements of Equal Minors in the Positive Grassmannian.” Advances in Mathematics 300 (September 2016): 788–834 © 2016 Elsevier Inc
Version
Original manuscript
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ö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 Eulerian number. On the other hand, we prove in many cases that arrangements of equal minors of smallest value are 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. Keywords: Totally positive matrices; The positive Grassmannian; Minors and Plücker coordinates; Matrix completion problem; Arrangements of equal minors; Weakly separated and sorted sets; Triangulations and thrackles; Cluster algebras and plabic graphs; The Laurent phenomenon; Alcoved polytopeshypersimplices; The affine Coxeter arrangement; The Eulerian numbers; Chain reactions of mutations; Mutation distancehoneycombs; Gröbner bases; Schur positivity
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/118450
DOI of Published Version
https://doi.org/10.1016/J.AIM.2016.03.031
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.