English

Dyck Paths and Positroids from Unit Interval Orders

Combinatorics 2018-02-13 v2

Abstract

It is well known that the number of non-isomorphic unit interval orders on [n][n] equals the nn-th Catalan number. Using work of Skandera and Reed and work of Postnikov, we show that each unit interval order on [n][n] naturally induces a rank nn positroid on [2n][2n]. We call the positroids produced in this fashion unit interval positroids. We characterize the unit interval positroids by describing their associated decorated permutations, showing that each one must be a 2n2n-cycle encoding a Dyck path of length 2n2n. We also provide recipes to read the decorated permutation of a unit interval positroid PP from both the antiadjacency matrix and the interval representation of the unit interval order inducing PP. Using our characterization of the decorated permutation, we describe the Le-diagrams corresponding to unit interval positroids. In addition, we give a necessary and sufficient condition for two Grassmann cells parameterized by unit interval positroids to be adjacent inside the Grassmann cell complex. Finally, we propose a potential approach to find the ff-vector of a unit interval order.

Cite

@article{arxiv.1611.09279,
  title  = {Dyck Paths and Positroids from Unit Interval Orders},
  author = {Anastasia Chavez and Felix Gotti},
  journal= {arXiv preprint arXiv:1611.09279},
  year   = {2018}
}

Comments

26 pages, 14 figures

R2 v1 2026-06-22T17:06:56.062Z