Related papers: On inverse ordered semigroups
A subgroup H of a group G is called inert if for each $g\in G$ the index of $H\cap H^g$ in $H$ is finite. We give a classification of soluble-by-finite groups $G$ in which subnormal subgroups are inert in the cases where $G$ has no…
A fuzzy subset $f$ of an ordered semigroup (or semigroup) $S$ is called fuzzy semiprime if $f(x)\ge f(x^2)$ for every $x\in S$ (Definition 1). Following the terminology of semiprime subsets of ordered semigroups (semigroups), the…
Recall that an element $x\in R$ is {\bf complemented} if there is a $y\in R$ such that $xy = 0$ and $x + y \in {\rm reg}(R)$. In a recent article [1], the authors investigated those rings for which every non-nilpotent element is…
First we give a definition of a coverage on a inverse semigroup that is weaker than the one gave by a Lawson and Lenz and that generalizes the definition of a coverage on a semilattice given by Johnstone. Given such a coverage, we prove…
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…
A CP-semigroup is aligned if its set of trivially maximal subordinates is totally ordered by subordination. We prove that aligned spatial E_0-semigroups are prime: they have no non-trivial tensor product decompositions up to cocycle…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
$E$-Ehresmann semigroups are a commonly studied generalization of inverse semigroups. They are closely related to Ehresmann categories in the same way that inverse semigroups are related to inductive groupoids. We prove that under some…
Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…
We describe how to construct all inverse semigroups Morita equivalent to a given inverse semigroup. This is done by taking the maximum inverse images of the regular Rees matrix semigroups over the inverse semigroup where the sandwich matrix…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
For an element a in a semigroup S the local subsemigroup of S with respect to a is the subsemigroup aSa of S and the variant of S with respect to a is a semigroup with underlying set S with a sandwich operation xy = xay for all x, y in S.…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
It is well known that inverse semigroups are closely related to \'etale groupoids. In particular, it has recently been shown that there is a (non-functorial) equivalence between localic \'etale groupoids, on one hand, and complete and…
A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is known to be a block-group, that is, a semigroup with at most…
Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we…
We prove a structure result on proper extensions of two-sided restriction semigroups in terms of partial actions, generalizing respective results for monoids and for inverse semigroups and upgrading the latter. We introduce and study…