1982
DOI: 10.21136/cmj.1982.101821
|View full text |Cite
|
Sign up to set email alerts
|

Cyclically ordered sets

Abstract: Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
23
0

Year Published

1984
1984
2020
2020

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(23 citation statements)
references
References 0 publications
0
23
0
Order By: Relevance
“…If L is a distributive lattice then the algebra .LI m/ is called the median algebra derived from L. Of course, there exist median algebras which are not derived from a lattice, see [1] for details, but in every median algebra there can be introduced a ternary relation "between" by putting In what follows, we show how this construction can be generalized and we get a characterization of some important properties of ternary relations by means of identities of their assigned operations. We can consider a number of properties of ternary relations which are used in [1][2][3][4][5][6][7][8][9][10][11] for "betweenness" and for "cyclic orders". .fag Z T .a; b/ fbg/:…”
Section: Ternary Operations Assigned To Ternary Relationsmentioning
confidence: 99%
See 1 more Smart Citation
“…If L is a distributive lattice then the algebra .LI m/ is called the median algebra derived from L. Of course, there exist median algebras which are not derived from a lattice, see [1] for details, but in every median algebra there can be introduced a ternary relation "between" by putting In what follows, we show how this construction can be generalized and we get a characterization of some important properties of ternary relations by means of identities of their assigned operations. We can consider a number of properties of ternary relations which are used in [1][2][3][4][5][6][7][8][9][10][11] for "betweenness" and for "cyclic orders". .fag Z T .a; b/ fbg/:…”
Section: Ternary Operations Assigned To Ternary Relationsmentioning
confidence: 99%
“…However, there exist also other useful ternary relations for which a similar construction is not already derived, in particular the so-called cyclic orders, see e.g. [4,7,8] and [9].…”
mentioning
confidence: 99%
“…S, i.e. there exist/eU(x), g e U(y), heU(z) with (/, g, h) e R. Thus dom/ = dom g = dom h = X, where -Y = (X, D n X 3 ) e e <£(//), x, >, z e X and (/(t), g((), h(t)) e C for any (e X. Further/(x) = co = g(>>) = = h(z). By Lemma 5, we have x # >> # z + x.…”
Section: Proof Let (U(x)u(y)u(z))ementioning
confidence: 99%
“…) is a cylically ordered set and H c G is such a subset that the induced cyclic order C n H 3 is linear on H, then H = (if, C n if 3 ) is called a cycle in G.…”
mentioning
confidence: 99%
“…A generahzation of this notion was investigated in a series of papers by Y. Novak and M. Novotny (cf., e.g., [8], [9]; cf. also [6] and the papers quoted there).…”
mentioning
confidence: 99%