Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders
The Electronic Journal of Combinatorics · 06.11.2026 · 33 (4)
DOI: 10.37236/11825 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 06.11.2026. Verfasst von Félix Gélinas und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Gélinas, F., Segovia, A., & Thomas, H. (2026). Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/11825
Vancouver
Gélinas F, Segovia A, Thomas H. Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/11825
BibTeX
@article{Glinas2026,
author = {Gélinas, Félix and Segovia, Adrien and Thomas, Hugh},
title = {Proof of a Conjecture of Matherne, Morales, and Selover on Encodings of Unit Interval Orders},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {4},
doi = {10.37236/11825}
}
EUVIMED