Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders

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 as forming the set of boxes between a Dyck path and the diagonal. Another is to find a particular part listing (in the sense of Guay-Paquet, Rowland and Morales) 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.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-11-06
DOI
https://doi.org/10.37236/11825
Citations
3
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
2.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders

Adrien Segovia, Félix Gélinas
3 citations
The Electronic Journal of Combinatorics
Advanced Combinatorial Mathematics
2.01
article

Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders

Adrien Segovia, Félix Gélinas
article en
3 citations

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 as forming the set of boxes between a Dyck path and the diagonal. Another is to find a particular part listing (in the sense of Guay-Paquet, Rowland and Morales) 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.

The Electronic Journal of CombinatoricsVol. 33(4)
Université du Québec à Montréal (CA)
Universities Space Research Association, Canada Research Chairs, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 23%
Advanced Combinatorial Mathematics
2.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon