Results 31 to 40 of about 1,290 (174)
Quasi-Semilattices on Networks
This paper introduces a representation of subnetworks of a network Γ consisting of a set of vertices and a set of relations, where relations are the primitive structures of a network. It is proven that all connected subnetworks of a network Γ form a quasi-semilattice L(Γ), namely a network quasi-semilattice.Two equivalences σ and δ are defined on L(Γ).
Yanhui Wang, Dazhi Meng
openaire +3 more sources
A distributive semilattice not isomorphic to the maximal semilattice quotient of the positive cone of any dimension group [PDF]
We construct a distributive 0-semilattice which is not isomorphic to the maximal semilattice quotient of the positive cone of any dimension group.
Růžička, Pavel
core +1 more source
On Graphs of Bounded Semilattices [PDF]
totally revised! Comments are still welcomed!
Malakooti Rad, P., Nasehpour, P.
openaire +2 more sources
On strategy-proofness and semilattice single-peakedness [PDF]
We study social choice rules defined on the domain of semilattice singlepeaked preferences. Semilattice single-peakedness has been identified as the necessary condition that a set of preferences must satisfy so that the set can be the domain of a ...
Institut d'Anàlisi Econòmica +3 more
core
Representation of right zero semigroups and their semilattices by a transformation semigroup
Background. As is known, an arbitrary semigroup can be represented by a semigroup of transformations that are right shifts either in this semigroup itself or in the extended semigroup obtained from the original one by adding an outer unit. The problems
L.V. Zyablitseva +2 more
doaj +1 more source
Distributive lattices have the intersection property [PDF]
Distributive lattices form an important, well-behaved class of lattices. They are instances of two larger classes of lattices: congruence-uniform and semidistributive lattices.
Henri Mühle
doaj +1 more source
Monotonic Distributive Semilattices [PDF]
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the variety of implicative meet-semilattices \cite{CelaniImplicative} \cite{ChajdaHalasKuhr}.
Sergio A. Celani, Ma. Paula Menchón
openaire +3 more sources
Tight Representations of 0-𝐸-Unitary Inverse Semigroups
We study the tight representation of a semilattice in {0,1} by some examples. Then we introduce the concept of the complex tight representation of an inverse semigroup 𝑆 by the concept of the tight representation of the semilattice of idempotents 𝐸 of 𝑆 ...
Bahman Tabatabaie Shourijeh +1 more
doaj +1 more source
A semilattice of varieties of completely regular semigroups [PDF]
Completely regular semigroups are unions of their (maximal) subgroups with the unary operation within their maximal subgroups. As such they form a variety whose lattice of subvarieties is denoted by $\mathcal L(\mathcal C\mathcal R)$.
Mario Petrich
doaj +1 more source
In this paper we shall study a notion of relative annihilator-preserving congruence relation and relative annihilator-preserving homomorphism in the class of bounded distributive semilattices. We shall give a topological characterization of this class of
Celani Sergio A.
doaj +1 more source

