zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Tolerances on median algebras. (English) Zbl 0538.08003

A ternary algebra M whose ternary operation (abc) satisfies the identities (aab)=a,(abc)=(bac)=(bca), and ((abc)de)=(a(bde)(cde)) for all a,b,c,d,einM is called a median algebra. Several papers have studied tolerances, reflexive and symmetric compatible relations on algebras. These relations are well understood for distributive lattices, median algebras, and tree algebras (median algebras in which any (abd), (acd), (bcd) are not distinct).

This paper gives the main facts, provides simple proofs, and extends some previous results concerning tolerances. The following are typical results. If ξ is a reflexive, symmetric relation on a tree algebra, then ξ is a tolerance if and only if all blocks of ξ are convex. A median algebra has the tolerance extension property if and only if it is a tree algebra. The lattice of all tolerances on a median algebra is distributive.

Reviewer: G.A.Fraser
08A30Subalgebras of general algebraic systems
08A05Structure theory of general algebraic systems
20N10Ternary systems (group theory)
06D05Structure and representation theory of distributive lattices