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

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

Constructions

Direct sum

Direct product

Power[2][3]

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} ∪ {hcm, bhm}. 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, 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.[5][6]

Notes

1. Novák 1982.
2. Novák & Novotný 1984a.
3. Novák & Novotný 1984b.
4. Megiddo 1976, pp. 274–275.
5. Megiddo 1976, pp. 275–276.
6. Galil & Megiddo 1977, p. 179.

References

• Galil, Zvi; Megiddo, Nimrod (October 1977), "Cyclic ordering is NP-complete" (PDF), Theoretical Computer Science, 5 (2): 179–182, doi:10.1016/0304-3975(77)90005-6, retrieved 30 April 2011
• Megiddo, Nimrod (March 1976), "Partial and complete cyclic orders" (PDF), Bulletin of the American Mathematical Society, 82 (2): 274–276, doi:10.1090/S0002-9904-1976-14020-7, retrieved 30 April 2011
• Novák, Vítězslav (1982), "Cyclically ordered sets" (PDF), Czechoslovak Mathematical Journal, 32 (3): 460–473, hdl:10338.dmlcz/101821, retrieved 30 April 2011
• Novák, Vítězslav; Novotný, Miroslav (1984a), "On a power of cyclically ordered sets" (PDF), Časopis Pro Pěstování Matematiky, 109 (4): 421–424, hdl:10338.dmlcz/118209, retrieved 30 April 2011
• Novák, Vítězslav; Novotný, Miroslav (1984b), "Universal cyclically ordered sets" (PDF), Czechoslovak Mathematical Journal, 35 (1): 158–161, hdl:10338.dmlcz/102004, retrieved 30 April 2011

Further reading

• Alles, Peter; Nešetřil, Jaroslav; Poljak, Svatopluck (1991), "Extendability, Dimensions, and Diagrams of Cyclic Orders", SIAM Journal on Discrete Mathematics, 4 (4): 453–471, doi:10.1137/0404041
• Bandelt, Hans–Jürgen; Chepoi, Victor; Eppstein, David (2010), "Combinatorics and geometry of finite and infinite squaregraphs" (PDF), SIAM Journal on Discrete Mathematics, 24 (4): 1399–1440, arXiv:0905.4537, doi:10.1137/090760301, retrieved 23 May 2011
• Chajda, Ivan; Novák, Vítězslav (1985), "On extensions of cyclic orders" (PDF), Časopis Pro Pěstování Matematiky, 110 (2): 116–121, hdl:10338.dmlcz/108597, retrieved 30 April 2011
• Fishburn, P. C.; Woodall, D. R. (June 1999), "Cycle Orders", Order, 16 (2): 149–164, doi:10.1023/A:1006381208272
• Haar, Stefan (2001), "Cyclic and partial order models for concurrency" (PDF), Geometry and Topology in Concurrency Theory GETCO '01, pp. 51–62, retrieved 23 May 2011
• Ille, Pierre; Ruet, Paul (30 April 2008), "Cyclic Extensions of Order Varieties", Electronic Notes in Theoretical Computer Science, 212: 119–132, CiteSeerX 10.1.1.103.2305, doi:10.1016/j.entcs.2008.04.057
• Jakubík, Ján (1994), "On extended cyclic orders" (PDF), Czechoslovak Mathematical Journal, 44 (4): 661–675, hdl:10338.dmlcz/128486, retrieved 30 April 2011
• Melliès, Paul-André (2004), "A topological correctness criterion for non-commutative logic" (PDF), in Thomas Ehrhard and Jean-Yves Girard and Paul Ruet and Philip Scott (ed.), Linear Logic in Computer Science, pp. 283–323, retrieved 23 May 2011
• Novák, Vítězslav (1984), "On some minimal problem" (PDF), Archivum Mathematicum, 20 (2): 95–99, hdl:10338.dmlcz/107191, MR 0784860, Zbl 0554.06003, retrieved 23 May 2011
• Stehr, Mark-Oliver (1998), "Thinking in Cycles", in Desel, Jörg; Silva, Manuel (eds.), ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, 1420, pp. 205–225, doi:10.1007/3-540-69108-1_12, ISBN 3-540-64677-9

• S. Haar.  Cyclic Ordering through Partial Orders.  Journal of Multiple-Valued Logic and Soft Computing 27(2-3), pages 209-228, 2016.

• http://www.lif.univ-mrs.fr/~lsantoca/TRECOLOCOCO/rencontre_Marseille/Stefan.pdf