Article · Wikipedia archive · Last revised Jun 21, 2026

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.

Last revised
Jun 21, 2026
Read time
≈ 4 min
Length
880 w
Citations
8
Source

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 {\displaystyle R} that is:

  • cyclic, i.e. it is invariant under a cyclic permutation: R ( x , y , z ) R ( y , z , x ) {\displaystyle R(x,y,z)\Rightarrow R(y,z,x)}
  • asymmetric: R ( x , y , z ) ( z , y , x ) {\displaystyle R(x,y,z)\Rightarrow \not R(z,y,x)}
  • transitive: R ( x , y , z ) {\displaystyle R(x,y,z)} and R ( x , z , u ) R ( x , y , u ) {\displaystyle R(x,z,u)\Rightarrow R(x,y,u)} 1

Constructions

Various constructions of partial cyclic orders have been studied, analogous to constructions of other mathematical structures. These include the direct sum, the direct product, the power23, and the Dedekind–MacNeille completion of a set.

Extensions

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.4

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, determining whether a general ternary relation (or indeed a partial cyclic order)5 extends to a total cyclic order is NP-complete, since it solves 3SAT. This is in stark contrast with the problem to recognize when a binary relation extends to a linear order, which can be solved in linear time.67 (In particular, every poset has a linear extension, even if it is infinite, by the Szpilrajn extension theorem.)

Several authors have considered the question of how complicated a non-extendable partial cyclic order must be. It is known that any partial cyclic order on 6 elements or fewer does extend to a total order. There is a single example (up to isomorphism) on 7 elements, which is constructed by adjoining an extra "point at infinity" to the standard example poset of dimension 3.8

Notes

Notes

References

References

Further reading

Further reading