Split semiorders (Q1296976)

Let \({\mathcal P}\) be the class of finite posets. Various subclasses of \({\mathcal P}\) generalizing the class of linear orders (weak orders, semiorders, interval orders, tolerance orders, etc.) have been studied recently. The authors deal mainly with the classes of split semiorders and split interval orders. A poset \(P=(X,\prec)\) is called a split semiorder if there are maps \(a,f:X\to R\) with \(a(x)\leq f(x)= a(x)+1\) for every \(x\in X\) such that \(x\prec y\) iff \(f(x)<a(y)\) and \(a(x)+1 <f(y)\). A split interval order is defined analogously starting from the notion of an interval order. In the paper the mentioned classes are compared with other important classes of posets and this comparison is completed by describing the triples of the maximun values of Idim, Sdim and dim for each class. Further it is proved that split semiorders and split interval orders have distinguishing representations. Minimally forbidden posets for the classes of posets in question are described there too. Finally, bipartite posets distinguishing classes of posets are discussed.