Order dimension

In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the intersection of which gives rise to the partial order. This concept is also sometimes called the order dimension or the Dushnik–Miller dimension of the partial order. first studied order dimension; for a more detailed treatment of this subject than provided here, see.

Formal definition
The dimension of a poset P is the least integer t for which there exists a family


 * $$\mathcal R=(<_1,\dots,<_t)$$

of linear extensions of P so that, for every x and y in P, x precedes y in P if and only if it precedes y in all of the linear extensions, if any such t exists. That is,


 * $$P=\bigcap\mathcal R=\bigcap_{i=1}^t <_i.$$

An alternative definition of order dimension is the minimal number of total orders such that P embeds into their product with componentwise ordering i.e. $$x \leq y$$ if and only if $$x_i \leq y_i$$ for all i.

Realizers
A family $$\mathcal R=(<_1,\dots,<_t)$$ of linear orders on X is called a realizer of a poset P = (X, &lt;P) if
 * $$<_P = \bigcap\mathcal R$$,

which is to say that for any x and y in X, x &lt;P y precisely when x &lt;1 y, x &lt;2 y, ..., and x &lt;t y. Thus, an equivalent definition of the dimension of a poset P is "the least cardinality of a realizer of P."

It can be shown that any nonempty family R of linear extensions is a realizer of a finite partially ordered set P if and only if, for every critical pair (x,y) of P, y &lt;i x for some order &lt;i in R.

Example
Let n be a positive integer, and let P be the partial order on the elements ai and bi (for 1 ≤ i ≤ n) in which ai ≤ bj whenever i ≠ j, but no other pairs are comparable. In particular, ai and bi are incomparable in P; P can be viewed as an oriented form of a crown graph. The illustration shows an ordering of this type for n = 4.

Then, for each i, any realizer must contain a linear order that begins with all the aj except ai (in some order), then includes bi, then ai, and ends with all the remaining bj. This is so because if there were a realizer that didn't include such an order, then the intersection of that realizer's orders would have ai preceding bi, which would contradict the incomparability of ai and bi in P. And conversely, any family of linear orders that includes one order of this type for each i has P as its intersection. Thus, P has dimension exactly n. In fact, P is known as the standard example of a poset of dimension n, and is usually denoted by Sn.

Order dimension two
The partial orders with order dimension two may be characterized as the partial orders whose comparability graph is the complement of the comparability graph of a different partial order. That is, P is a partial order with order dimension two if and only if there exists a partial order Q on the same set of elements, such that every pair x, y of distinct elements is comparable in exactly one of these two partial orders. If P is realized by two linear extensions, then partial order Q complementary to P may be realized by reversing one of the two linear extensions. Therefore, the comparability graphs of the partial orders of dimension two are exactly the permutation graphs, graphs that are both themselves comparability graphs and complementary to comparability graphs.

The partial orders of order dimension two include the series-parallel partial orders. They are exactly the partial orders whose Hasse diagrams have dominance drawings, which can be obtained by using the positions in the two permutations of a realizer as Cartesian coordinates.

Computational complexity
It is possible to determine in polynomial time whether a given finite partially ordered set has order dimension at most two, for instance, by testing whether the comparability graph of the partial order is a permutation graph. However, for any k ≥ 3, it is NP-complete to test whether the order dimension is at most k.

Incidence posets of graphs
The incidence poset of any undirected graph G has the vertices and edges of G as its elements; in this poset, x ≤ y if either x = y or x is a vertex, y is an edge, and x is an endpoint of y. Certain kinds of graphs may be characterized by the order dimensions of their incidence posets: a graph is a path graph if and only if the order dimension of its incidence poset is at most two, and according to Schnyder's theorem it is a planar graph if and only if the order dimension of its incidence poset is at most three.

For a complete graph on n vertices, the order dimension of the incidence poset is $$\Theta(\log\log n)$$. It follows that all simple n-vertex graphs have incidence posets with order dimension $$O(\log\log n)$$.

k-dimension and 2-dimension
A generalization of dimension is the notion of k-dimension (written $$\textrm{dim}_k$$) which is the minimal number of chains of length at most k in whose product the partial order can be embedded. In particular, the 2-dimension of an order can be seen as the size of the smallest set such that the order embeds in the inclusion order on this set.