Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Arrangements of equa ...
Conference paper

Arrangements of equal minors in the positive Grassmannian

Miriam Farber (1), Alexander Postnikov (1)
(1) Department of Mathematics [MIT]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2441
License
https://about.hal.science/hal-authorisation-v1
Graduate Research Fellowship Program
Indicators
688
Views
1141
Downloads

Arrangements of equal minors in the positive Grassmannian

Miriam Farber (1), Alexander Postnikov (1)
(1) Department of Mathematics [MIT]
Abstract
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>.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Totally positive matrices
  • minors
  • the positive Grassmannian
  • Plücker coordinates
  • matrix completion problem
  • weakly separated sets
  • cluster algebras
  • plabic graphs
  • sorted sets
  • triangulations
  • thrackles
  • alcoved polytopes
  • affine Coxeter arrangements
  • hypersimplices
  • Eulerian numbers
  • Gröbner bases
  • Schur positivity.
Cited by

Source: OpenCitations

  • Dimers, webs, and positroids

    arXiv (Cornell University)

    Authors : Thomas Lam

    Journal reference : Volume 92, 2015, pp. 633-656

    DOI : 10.1112/jlms/jdv039
Preview
Loading PDF preview...