On completion of cyclically ordered sets

From MaRDI portal





A cyclic order on a set G is a ternary relation C on G, which is: (i) asymmetric, i.e. (x,y,z)\(\in C\) implies (z,y,x)\({\bar \in}C\), (ii) cyclic, i.e. (x,y,z)\(\in C\) implies (y,z,x)\(\in C\), and (iii) transitive, i.e. (x,y,z)\(\in C\) and (x,z,u)\(\in C\) together imply (x,y,u)\(\in C.\) If, moreover, card \(G\geq 3\), and for any three pairwise different elements either (x,y,z)\(\in C\) or (z,y,x)\(\in C\) then C is linear, and (G,C) is called a linearly cyclically ordered set or a cycle. Earlier [Czech. Math. J. 34(109), 322-333 (1984; Zbl 0551.06002)] the first author has constructed a completion of cycles by means of cuts. In this note the authors give another construction of a completion, which can be applied to a larger class of monodimensional cyclically ordered sets.











This page was built for publication: On completion of cyclically ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775596)