Pith. sign in

REVIEW 1 cited by

Proof of a conjecture of Matherne, Morales, and Selover on encodings of 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 2212.12171 v1 pith:WMKQ4OI5 submitted 2022-12-23 math.CO

classification math.CO
keywords dyckintervalunitconjectureelementslistingmathernemorales
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

There are two bijections from unit interval orders on $n$ elements to Dyck paths from $(0,0)$ to $(n,n)$. One is to consider the pairs of incomparable elements, which form the set of boxes between some Dyck path and the diagonal. Another is to find a particular part listing (in the sense of Guay-Paquet) which yields an isomorphic poset, and to interpret the part listing as the area sequence of a Dyck path. Matherne, Morales, and Selover conjectured that, for any unit interval order, these two Dyck paths are related by Haglund's well-known zeta bijection. In this paper we prove their conjecture.

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. Chromatic symmetric functions of claw-free graphs are not Schur positive

    math.CO 2026-07 conditional novelty 7.0 of 10

    Two line graphs with 12 vertices have non-Schur-positive chromatic symmetric functions, and a bipartite Schur-positive graph has an unsaturated Newton polytope, disproving two conjectures.

Pith tools