Miriam Farber ; Yelena Mandelshtam - Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex

dmtcs:2469 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2469
Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The HypersimplexArticle

Authors: Miriam Farber 1; Yelena Mandelshtam ORCID2

  • 1 Department of Mathematics [MIT]
  • 2 Department of Mathematics [Irvine]

The structure of zero and nonzero minors in the Grassmannian leads to rich combinatorics of matroids. In this paper, we investigate an even richer structure of possible equalities and inequalities between the minors in the positive Grassmannian. It was previously shown that arrangements of equal minors of largest value are in bijection with the simplices in a certain triangulation of the hypersimplex that was studied by Stanley, Sturmfels, Lam and Postnikov. Here we investigate the entire set of arrangements and its relations with this triangulation. First, we show that second largest minors correspond to the facets of the simplices. We then introduce the notion of cubical distance on the dual graph of the triangulation, and study its relations with the arrangement of t-th largest minors. Finally, we show that arrangements of largest minors induce a structure of partially ordered sets on the entire collection of minors. We use the Lam and Postnikov circuit triangulation of the hypersimplex to describe a 2-dimensional grid structure of this poset.


Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Graduate Research Fellowship Program; Funder: National Science Foundation; Code: 1122374

1 Document citing this article

Consultation statistics

This page has been seen 282 times.
This article's PDF has been downloaded 308 times.