Positroids and non-crossing partitions

By Federico Ardila, Felipe Rinc'on, Lauren K. Williams. 2013

78 citations recorded by the source corpus.

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. This structural result yields several combinatorial facts about positroids. We show that the face poset of a positroid polytope embeds in a poset of weighted non-crossing partitions. We enumerate connected positroids, and show how they arise naturally in free probability. Finally, we prove that the probability that a positroid on [n] is connected equals 1/e^2 asymptotically.

Subfields: Discrete Mathematics and Combinatorics, Materials Chemistry, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/85e778cf596683faa5960e1fa9e5be86dd1acb33

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. David E. Speyer
  2. Lauren K. Williams
  3. Emmanuel Tsukerman
  4. Thomas Lam
  5. Greg Muller
  6. Yuji Kodama
  7. Bernard Leclerc
  8. Federico Ardila

In Materials Chemistry

  1. Emmanuel Tsukerman
  2. Lauren K. Williams

In Statistics and Probability

  1. Emmanuel Tsukerman
  2. Lauren K. Williams
  3. David E. Speyer
  4. Petter Brand'en

Citations in the corpus