Suho Oh - Combinatorics of Positroids

dmtcs:2697 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) - https://doi.org/10.46298/dmtcs.2697
Combinatorics of PositroidsArticle

Authors: Suho Oh 1

  • 1 Department of Mathematics [MIT]

Recently Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. There are many interesting combinatorial objects associated to a positroid. We introduce some recent results, including the generalization and proof of the purity conjecture by Leclerc and Zelevinsky on weakly separated sets.

https://doi.org/10.46298/dmtcs.2697
Source: HAL:hal-01185389v1
Volume: DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Section: Proceedings
Published on: January 1, 2009
Imported on: January 31, 2017
Keywords: Positroids,Total positivity,Grassmannian,Matroids,$\rfloor$-diagrams,Decorated permutations,Weakly separated.,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 197 times.
This article's PDF has been downloaded 464 times.