Related papers: Finite Atomized Semilattices
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
To represent anything from mathematical concepts to real-world objects, we have to resort to an encoding. Encodings, such as written language, usually assume a decoder that understands a rich shared code. A semantic embedding is a form of…
Orbital semilattices are introduced as bounded semilattices that are, in addition, equipped with an outer multiplication (a semigroup action) and diagonals (a concept borrowed from cylindric algebra), where each semilattice element has a…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We investigate endomorphism semirings of a finite semilattice with one least element and one greatest element such that all the other elements form an antichain. We construct some new finite simple semirings. Keywords: endomorphism…
A specialization semilattice is a structure which can be embedded into $(\mathcal P(X), \cup, \sqsubseteq )$, where $X$ is a topological space, $ x \sqsubseteq y$ means $x \subseteq Ky$, for $x,y \subseteq X$, and $K$ is closure in $X$.…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…