By a nearlattice is meant a join-semilattice where every principal filter is a lattice with respect to the induced order. The aim of our paper is to show for which nearlattice and its element the mapping is a (surjective, injective) homomorphism of into .
We establish categorical dualities between varieties of isotropic median algebras and suitable categories of operational and relational topological structures. We follow a general duality theory of B.A. Davey and H. Werner. The duality results are used to describe free isotropic median algebras. If the number of free generators is less than five, the description is detailed.
The Cantor-Bernstein-Schröder theorem of the set theory was generalized by Sikorski and Tarski to -complete boolean algebras, and recently by several authors to other algebraic structures. In this paper we expose an abstract version which is applicable to algebras with an underlying lattice structure and such that the central elements of this lattice determine a direct decomposition of the algebra. Necessary and sufficient conditions for the validity of the Cantor-Bernstein-Schröder theorem for...
A meet semilattice with a partial join operation satisfying certain axioms is a JP-semilattice. A PJP-semilattice is a pseudocomplemented JP-semilattice. In this paper we describe the smallest PJP-congruence containing a kernel ideal as a class. Also we describe the largest PJP-congruence containing a filter as a class. Then we give several characterizations of congruence kernels and cokernels for distributive PJP-semilattices.
We investigate the convex invariants associated with two-path convexity in clone-free multipartite tournaments. Specifically, we explore the relationship between the Helly number, Radon number and rank of such digraphs. The main result is a structural theorem that describes the arc relationships among certain vertices associated with vertices of a given convexly independent set. We use this to prove that the Helly number, Radon number, and rank coincide in any clone-free bipartite tournament. We...
By applying the solution of the internal direct product decomposition we investigate the relations between convex isomorphisms and direct product decompositions of directed multilattices.
The concept of covering energy of a poset is known and its McClelland type bounds are available in the literature. In this paper, we establish formulas for the covering energy of a crown with elements and a fence with elements. A lower bound for the largest eigenvalue of a poset is established. Using this lower bound, we improve the McClelland type bounds for the covering energy for some special classes of posets.