Related papers: On right $\pi$-inverse ordered semigroups
We introduce the concept of an extension of a semilattice of groups $A$ by a group $G$ and describe all the extensions of this type which are equivalent to the crossed products $A*_\Theta G$ by twisted partial actions $\Theta$ of $G$ on…
Let ${\cal I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal DP}_n$ and ${\cal ODP}_n$ be its subsemigroups of partial isometries and of order-preserving partial isometries of $X_n$, respectively. In this…
A subsemigroup S of a semigroup Q is a local left order in Q if, for every maximal subgroup H of Q, the intersection of S with H is a local left order in the sense of group theory. That is, every q in H can be written as a#b for some a,b in…
In this paper we investigate right uniform notion on some classes of semigroups. The main objective of this paper is realizing the structure of regular right uniform semigroups which can be applied as a cornerstone of characterizing regular…
Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…
For an intra-regular or a left regular and left duo ordered $\Gamma$-semigroup $M$, we describe the principal filter of $M$ which plays an essential role in the structure of this type of $po$-$\Gamma$-semigroups. We also prove that an…
We discuss the relationship between tight and cover-to-join representations of semilattices and inverse semigroups, showing that a slight extension of the former, together with an appropriate selection of co-domains, makes the two notions…
The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…
In this article we will study semigroupoids, and more specifically inverse semigroupoids. These are a common generalization to both inverse semigroups and groupoids, and provide a natural language on which several types of dynamical…
Crisp and lattice-valued ambiguous representations of one continuous semilattice in another one are introduced and operation of taking pseudo-inverse of the above relations is defined. It is shown that continuous semilattices and their…
This is an account of the theory of inverse semigroups, assuming only that the reader knows the basics of semigroup theory.
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
An inverse semigroup $S$ is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if $a \in S$ then there exists a unique $b\in S$ such that $a = aba$ and $b = bab$. We say that an inverse…
In this paper we compute the rank and exhibit a presentation for the monoids of all $P$-stable and $P$-order preserving partial permutations on a finite set $\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…