Hereditary Semiorders and Enumeration of Semiorders by Dimension
Mitchel T. Keller, Stephen J. Young

TL;DR
This paper characterizes hereditary semiorders, explores their enumeration via generating functions, and describes semiorders of dimension at most 2, advancing understanding of semiorder structure and enumeration.
Contribution
It introduces the concept of hereditary semiorders, provides their structural characterization, and derives generating functions for these and semiorders of dimension at most 2.
Findings
Hereditary semiorders are characterized structurally.
Generated functions for hereditary semiorders are determined.
Semiorders of dimension at most 2 are structurally described.
Abstract
In 2010, Bousquet-M\'elou et al. defined sequences of nonnegative integers called ascent sequences and showed that the ascent sequences of length are in one-to-one correspondence with the interval orders, i.e., the posets not containing the poset . Through the use of generating functions, this provided an answer to the longstanding open question of enumerating the (unlabeled) interval orders. A semiorder is an interval order having a representation in which all intervals have the same length. In terms of forbidden subposets, the semiorders exclude and . The number of unlabeled semiorders on points has long been known to be the -th Catalan number. However, describing the ascent sequences that correspond to the semiorders under the bijection of Bousquet-M\'elou et al. has proved difficult. In this paper, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
