Related papers: Semilattices with a congruence
We characterise the frame morphisms $f:L\to M$ that lift to frame maps $\overline{f}:\mathsf{S}_b(L)\to \mathsf{S}_b(M)$, where $\mathsf{S}_b(L)$ is the collection of joins of complemented sublocales of a frame $L$, or equivalently the…
We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…
Coherence simplices are generic topological correlation-function defects supported by a hierarchy of coherence functions. We classify coherence simplices based on their topology and discuss their structure and dynamics, together with their…
Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…
In the paper we present various characterizations of chain-compact and chain-finite topological semilattices. A topological semilattice $X$ is called chain-compact (resp. chain-finite) if each closed chain in $X$ is compact (finite). In…
We consider two relations on a $\cap$-semigroup of partial functions of a given set: the inclusion of domains and the semiadjacencity (i.e., the inclusion of the image of the first function into the domain of the second), which…
Starting from the varietal notion of syntactic equivalence relation, we generalized it to a categorical concept; namely Equ-saturating category. We produce various examples and focuse our attention on the protomodular context in which any…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We…
Inverse semigroups are a class of semigroups whose structure induces a compatible partial order. This partial order is examined so as to establish mirror properties between an inverse semigroup and the semilattice of its idempotent…
We present an intrinsic and concrete development of the subdivision of small categories, give some simple examples and derive its fundamental properties. As an application, we deduce an alternative way to compare the homotopy categories of…
A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found,…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
Many classification problems involve data instances that are interlinked with each other, such as webpages connected by hyperlinks. Techniques for "collective classification" (CC) often increase accuracy for such data graphs, but usually…