On determination of a cyclic order (Q3322156)
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 3853152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On determination of a cyclic order |
scientific article; zbMATH DE number 3853152 |
Statements
1983
0 references
ternary relation
0 references
ordered set
0 references
cyclic order
0 references
On determination of a cyclic order (English)
0 references
0 references
0 references
0 references
0.88735026
0 references
0.88529897
0 references
0 references
0 references
A ternary relation C on a set G is called a cyclic order iff (i) \((x,y,z)\in C\) implies \((z,y,x)\not\in C,\) (ii) \((x,y,z)\in C\) and \((x,z,u)\in C\) imply \((x,y,u)\in C\) and (iii) \((x,y,z)\in C\) implies \((y,z,x)\in C.\) Let \((G,<)\) be an ordered set. Put \((x,y,z)\in C_<\) iff either \(x<y<z,\) or \(y<z<x\) or \(z<x<y\), then \(C_<\) is a cyclic order. Further, if a family \((<_ i)_{i\in I}\) of orderings on G satisfies certain conditions, then the union \(\cup_{i\in I}C_{<_ i}\) is a cyclic order on G. Any cyclic order on G has such representations. Theorems about the minimum cardinality w(G,C) of I of such representations of C, as well as the minimum cardinality W(G,C) of such I, when the orderings \(<_ i\) are all restricted as linear, are studied. For example, \(w(G,C)\leq card G.\) Another section is devoted to study a ternary relation on G, which is complementary in \(G^ 3\) to a cyclic order.
0 references