Discrete Mathematics & Theoretical Computer Science |

- 1 Department of Mathematics [San Francisco]
- 2 Universidad de los Andes [Bogota]
- 3 Warwick Mathematics Institute
- 4 Department of Mathematics [Berkeley]

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: 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

Imported 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]

Funding:

- Source : OpenAIRE Graph
*CAREER: Matroids, polytopes, and their valuations in algebra and geometry*; Funder: National Science Foundation; Code: 0956178*CAREER: Cluster algebras, total positivity, and physical combinatorics*; Funder: National Science Foundation; Code: 1049513

This page has been seen 229 times.

This article's PDF has been downloaded 261 times.