Ardila, Federico and Rincón, Felipe and Williams, Lauren - Positroids, non-crossing partitions, and positively oriented matroids

dmtcs:2431 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Positroids, non-crossing partitions, and positively oriented matroids

Authors: Ardila, Federico and Rincón, Felipe and Williams, Lauren

We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground set, and then freely placing the structure of a connected positroid on each of the blocks of the partition. We use this to enumerate connected positroids, and we prove that the probability that a positroid on [n] is connected equals $1/e^2$ asymptotically. We also prove da Silva's 1987 conjecture that any positively oriented matroid is a positroid; that is, it can be realized by a set of vectors in a real vector space. It follows from this result that the positive matroid Grassmannian (or <i>positive MacPhersonian</i>) is homeomorphic to a closed ball.


Source : oai:HAL:hal-01207540v1
Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Submitted on: November 21, 2016
Keywords: positroid,non-crossing partition,matroid polytope,oriented matroid,matroid Grassmannian.,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 30 times.
This article's PDF has been downloaded 60 times.