Compatible tolerances on groupoids
Weakly atomic lattices with Stonean congruence lattice
Lattices with complemented tolerance lattice
We characterize lattices with a complemented tolerance lattice. As an application of our results we give a characterization of bounded weakly atomic modular lattices with a Boolean tolerance lattice.
On distances and metrics in discrete ordered sets
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural, difference-of-height distance measured in a chain. It is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the...
Congruence schemes and their applications
Using congruence schemes we formulate new characterizations of congruence distributive, arithmetical and majority algebras. We prove new properties of the tolerance lattice and of the lattice of compatible reflexive relations of a majority algebra and generalize earlier results of H.-J. Bandelt, G. Cz'{e}dli and the present authors. Algebras whose congruence lattices satisfy certain 0-conditions are also studied.
The congruence lattice of implication algebras.
The minimal closed monoids for the Galois connection -
The minimal nontrivial endomorphism monoids of congruence lattices of algebras defined on a finite set are described. They correspond (via the Galois connection -) to the maximal nontrivial congruence lattices investigated and characterized by the authors in previous papers. Analogous results are provided for endomorphism monoids of quasiorder lattices .
Page 1