Related papers: Finite Atomized Semilattices
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…
On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
A finite W-algebra is an associative algebra constructed from a semisimple Lie algebra and its nilpotent element. In this survey we review recent developments in the representation theory of W-algebras. We emphasize various interactions…
As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $\mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic…
In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…
As well-known, in a finitary algebraic structure the set $\Gamma$ of all the non-generators is the intersection of all the maximal proper substructures. In particular, $\Gamma$ is a substructure. We show that the corresponding statements…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
It is well known that the subvariety lattice of the variety of relation algebras has exactly three atoms. The (join-irreducible) covers of two of these atoms are known, but a complete classification of the (join-irreducible) covers of the…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…
Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…
We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.