Partial cyclic order

In mathematics, a partial cyclic order is a ternary relation that generalizes a cyclic order in the same way that a partial order generalizes a linear order.

Definition
Over a given set, a partial cyclic order is a ternary relation $$R$$ that is:
 * cyclic, i.e. it is invariant under a cyclic permutation: $$R(x, y, z) \Rightarrow R(y, z, x)$$
 * asymmetric: $$R(x, y, z) \Rightarrow \not R(z, y, x)$$
 * transitive: $$R(x, y, z)$$ and $$R(x, z, u) \Rightarrow R(x, y, u)$$

Constructions
Direct sum

Direct product

Power

Dedekind–MacNeille completion

Extensions
linear extension, Szpilrajn extension theorem

standard example

The relationship between partial and total cyclic orders is more complex than the relationship between partial and total linear orders. To begin with, not every partial cyclic order can be extended to a total cyclic order. An example is the following relation on the first thirteen letters of the alphabet: {acd, bde, cef, dfg, egh, fha, gac, hcb} ∪ {abi, cij, bjk, ikl, jlm, kma, lab, mbc}. This relation is a partial cyclic order, but it cannot be extended with either abc or cba; either attempt would result in a contradiction.

The above was a relatively mild example. One can also construct partial cyclic orders with higher-order obstructions such that, for example, any 15 triples can be added but the 16th cannot. In fact, cyclic ordering is NP-complete, since it solves 3SAT. This is in stark contrast with the recognition problem for linear orders, which can be solved in linear time.