English

Interval Orders with Two Interval Lengths

Combinatorics 2017-07-26 v1

Abstract

A poset P=(X,)P = (X,\prec) has an interval representation if each xXx \in X can be assigned a real interval IxI_x so that xyx \prec y in PP if and only if IxI_x lies completely to the left of IyI_y. Such orders are called \emph{interval orders}. In this paper we give a surprisingly simple forbidden poset characterization of those posets that have an interval representation in which each interval length is either 0 or 1. In addition, for posets (X,)(X,\prec) with a weight of 1 or 2 assigned to each point, we characterize those that have an interval representation in which for each xXx \in X the length of the interval assigned to xx equals the weight assigned to xx. For both these problems we can determine in polynomial time whether the desired interval representation is possible and in the affirmative case, produce such a representation.

Keywords

Cite

@article{arxiv.1707.08093,
  title  = {Interval Orders with Two Interval Lengths},
  author = {Simona Boyadzhiyska and Garth Isaak and Ann N Trenk},
  journal= {arXiv preprint arXiv:1707.08093},
  year   = {2017}
}

Comments

21 pages, 5 figures