Positroids and non-crossing partitions
Positroids and non-crossing partitions
复制标题
DOI:
10.1090/tran/6331
复制
发表时间:
2013-08
影响因子:
1.3
通讯作者:
Federico Ardila;F. Rincón;L. Williams
中科院分区:
文献类型:
--
作者:
Federico Ardila;F. Rincón;L. Williams
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.