Cuts in cyclically ordered sets (Q3344240)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3877240
Language Label Description Also known as
default for all languages
No label defined
    English
    Cuts in cyclically ordered sets
    scientific article; zbMATH DE number 3877240

      Statements

      1984
      0 references
      cyclically ordered set
      0 references
      linear order
      0 references
      cuts
      0 references
      dense sets
      0 references
      0 references
      0 references
      0 references
      Cuts in cyclically ordered sets (English)
      0 references
      A cyclic order \(C\) on a set \(G\) is a ternary relation which is asymmetric \(((x,y,z)\in C\) implies \((z,y,x)\in C)\), cyclic \(((x,y,z)\in C\) implies \((y,z,x)\in C)\), transitive ((x,y,z)\(\in C\), (x,z,u)\(\in C\) implies \((x,y,y)\in C)\) and linear (x,y,z\(\in G\), \(x\neq y\neq z\neq x\) implies \((x,y,z)\in C\) or \((z,y,x)\in C)\). The pair \((G,C)\) is called a cyclically ordered set. A cut on \((G,C)\) is a linear order \(<\) on \(G\) with the property: \(x<y<z\) implies \((x,y,z)\in C\). The paper is concerned with the study of properties of cuts. The connection between the dense sets defined by means of cuts and dense sets defined by means of linear orders is studied. Then, the set of all cuts on \((G,C)\) is structured as a cyclically ordered set and it is proved that it has no gaps. (The cut \((G,<)\) is a gap if it has neither a least nor a greatest element).
      0 references

      Identifiers