SearcharxivSearch

arXiv subjects

Randy Shull

Publications and source records attributed to Randy Shull.

3 recordsLinked to original sources

Tolerance Orders of Open and Closed Intervals

In this paper we combine ideas from tolerance orders with recent work on OC interval orders. We consider representations of posets by unit intervals $I_v$ in which the interval endpoints ($L(v)$ and $R(v)$) may be open or closed as well as the center point ($c(v)$). This yields four types of intervals: $A$ (endpoints and center points closed), $B$ (endpoints and center points open), $C$ (endpoints closed, center points open), and $D$ (endpoints open, center points closed). For any non-empty subset $S$ of $\{A,B,C,D\}$, we define an $S$-order as a poset $P$ that has a representation as follows: each element $v$ of $P$ is assigned a unit interval $I_v$ of type belonging to $S$, and $x \prec y$ if and only if either (i) $R(x) < c(y)$ or (ii) $R(x) = c(y)$ and at least one of $R(x), c(y)$ is open and at least one of $L(y), c(x)$ is open. We characterize several of the classes of $S$-orders and provide separating examples between unequal classes. In addition, for each $S \subseteq \{A,B,C,D\}$ we present a polynomial-time algorithm that recognizes $S$-orders, providing a representation when one exists and otherwise providing a certificate showing it is not an $S$-order.

math.CO

Unit Interval Orders of Open and Closed Intervals

A poset $P = (X,\prec)$ is a unit OC interval order if there exists a representation that assigns an open or closed real interval $I(x)$ of unit length to each $x \in P$ so that $x \prec y$ in $P$ precisely when each point of $I(x)$ is less than each point in $I(y)$. In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. The algorithm takes a poset $P $ as input and either produces a representation or returns a forbidden poset induced in $P$.

math.CO

Unit Mixed Interval Graphs

In this paper we extend the work of Rautenbach and Szwarcfiter by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that may or may not contain their endpoints. A characterization was proved independently by Joos, however our approach provides an algorithm that produces such a representation, as well as a forbidden graph characterization.

math.CO