Pith. sign in

REVIEW 1 cited by

Dyck Paths and Positroids from Unit Interval Orders

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.09279 v2 pith:TE23BENN submitted 2016-11-28 math.CO

classification math.CO
keywords intervalunitpositroidsdecoratedorderdyckgrassmannnumber
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

It is well known that the number of non-isomorphic unit interval orders on $[n]$ equals the $n$-th Catalan number. Using work of Skandera and Reed and work of Postnikov, we show that each unit interval order on $[n]$ naturally induces a rank $n$ positroid on $[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 $2n$-cycle encoding a Dyck path of length $2n$. We also provide recipes to read the decorated permutation of a unit interval positroid $P$ from both the antiadjacency matrix and the interval representation of the unit interval order inducing $P$. 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 $f$-vector of a unit interval order.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Combinatorics of the geometry of Wilson loop diagrams I: equivalence classes via matroids and polytopes

    math-ph 2019-08 conditional novelty 7.0 of 10

    Two Wilson loop diagrams define the same positroid exactly when they differ by retriangulating certain exact subdiagrams, and inequivalent diagrams correspond to non-parallel faces of an associahedron.

Pith tools