A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
International audience 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 equalsdoi:10.46298/dmtcs.2431 fatcat:vklnn5rudrbu5nse2ajo6mizjq