Table of Contents
Fetching ...

On hybrid order dimension

Athanasios Andrikopoulos

TL;DR

Three main results of the theory of hybric order dimension are given, which gives a common generalization of linear order and interval order (semiorder) dimension and is arguably the most important measure of ordered set complexity.

Abstract

The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked at the time. Interval orders play an important role in many areas of pure and applied mathematics, graph theory, computer science and engineering. Special cases of interval order are the semiorder and linear order. All of these notions are especially important in the study of linear-interval and linear-semiorder dimension of a binary relation. This kind of dimension, which we call {\it hybrid order dimension}, gives a common generalization of linear order and interval order (semiorder) dimension and is arguably the most important measure of ordered set complexity. In this paper, we present three main results of the theory of hybrid order dimension. More specifically, we obtain necessary and sufficient conditions for a binary relation to have an interval order (resp. linear-interval order, linear-simiorder) extension, as well as an interval order realizer of interval orders (resp. linear-interval orders, linear-simiorders). We also obtain a characterization of the interval order (resp. linear-interval order, linear-simiorder) dimension. Because a binary relation's hybrid order dimension is less than its (linear) order dimension, these results will be able to improve known results in graph theory and computer science by identifying more efficient algorithms.

On hybrid order dimension

TL;DR

Three main results of the theory of hybric order dimension are given, which gives a common generalization of linear order and interval order (semiorder) dimension and is arguably the most important measure of ordered set complexity.

Abstract

The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked at the time. Interval orders play an important role in many areas of pure and applied mathematics, graph theory, computer science and engineering. Special cases of interval order are the semiorder and linear order. All of these notions are especially important in the study of linear-interval and linear-semiorder dimension of a binary relation. This kind of dimension, which we call {\it hybrid order dimension}, gives a common generalization of linear order and interval order (semiorder) dimension and is arguably the most important measure of ordered set complexity. In this paper, we present three main results of the theory of hybrid order dimension. More specifically, we obtain necessary and sufficient conditions for a binary relation to have an interval order (resp. linear-interval order, linear-simiorder) extension, as well as an interval order realizer of interval orders (resp. linear-interval orders, linear-simiorders). We also obtain a characterization of the interval order (resp. linear-interval order, linear-simiorder) dimension. Because a binary relation's hybrid order dimension is less than its (linear) order dimension, these results will be able to improve known results in graph theory and computer science by identifying more efficient algorithms.

Paper Structure

This paper contains 8 sections, 51 theorems, 2 figures.

Key Result

Corollary 3.1

A binary relation $R$ on a set $X$ has a strict linear order extension if and only if $R$ is an acyclic binary relation.

Figures (2)

  • Figure 1: (a) A simple-triangle graph A. (b) An intersection representation of A.
  • Figure 2: $R$ satisfies the negative interval order assumption (or the 2+2 rule) iff a restriction of it is isomorphic to (a) and it satisfies the negative semiorder assumption (or 3+1 rule) iff a restriction of it is isomorphic to either (a) or (b).

Theorems & Definitions (101)

  • Example 2.1
  • Corollary 3.1
  • proof
  • Definition 3.1
  • Proposition 3.2
  • proof
  • Remark 3.3
  • Lemma 3.4
  • proof
  • Theorem 3.5
  • ...and 91 more