Let Q be an inverse semigroup. A subsemigroup S of Q is a left I-order in Q, and Q is a semigroup of left I-quotients of S, if every element in Q can be written as a^{-1}b, where a, b \in S and a^{-1} is the inverse of a in the sense of inverse semigroup theory. If we insist on a and b being R-related in Q, we say that S is straight in Q and Q is a semigroup of straight left I-quotients of S. In Chapter 4, we give two equivalent sets of necessary and sufficient conditions for a semigroup to be a straight left I-order. The first set of conditions is in terms of two binary relations and an associated partial order and the proof relies on the meet structure of the L-classes of inverse semigroups. The second set of conditions in terms of two...
AbstractWe show how the correspondence between inverse semigroups and inductive groupoids (a class o...
A generalised D-semigroup is here defined to be a left E-semiabundant semigroup S in which the \over...
This thesis originated in an effort to find an efficient algorithm for the construction of finite in...
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a sem...
AbstractA subsemigroup S of a semigroup Q is a local left order in Q if, for every group H-class H o...
Abstract. A subsemigroup S of an inverse semigroup Q is a left I-order in Q if every element in Q ca...
Much work has been done on the ℓ¹-algebras of groups, but much less on ℓ¹-algebras of semigroups. Th...
AbstractA semigroup S (with zero) is called a right inverse semigroup if every (nonnull) principal l...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
AbstractThe theory in this paper was motivated by an example of an inverse semigroup important in Gi...
We present an approach to construct order relations on semigroups via inverses along elements and su...
The study of congruence relations is acknowledged as fundamental to the study of algebras. Inverse s...
Abstract. In any semigroup S, we say that elements a and b are left inverses of each other if a = ab...
AbstractLet S be an inverse semigroup with semilattice of idempotents E, and let ϱ(S), or ϱ if there...
AbstractWe show how the correspondence between inverse semigroups and inductive groupoids (a class o...
A generalised D-semigroup is here defined to be a left E-semiabundant semigroup S in which the \over...
This thesis originated in an effort to find an efficient algorithm for the construction of finite in...
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a sem...
AbstractA subsemigroup S of a semigroup Q is a local left order in Q if, for every group H-class H o...
Abstract. A subsemigroup S of an inverse semigroup Q is a left I-order in Q if every element in Q ca...
Much work has been done on the ℓ¹-algebras of groups, but much less on ℓ¹-algebras of semigroups. Th...
AbstractA semigroup S (with zero) is called a right inverse semigroup if every (nonnull) principal l...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
AbstractThe theory in this paper was motivated by an example of an inverse semigroup important in Gi...
We present an approach to construct order relations on semigroups via inverses along elements and su...
The study of congruence relations is acknowledged as fundamental to the study of algebras. Inverse s...
Abstract. In any semigroup S, we say that elements a and b are left inverses of each other if a = ab...
AbstractLet S be an inverse semigroup with semilattice of idempotents E, and let ϱ(S), or ϱ if there...
AbstractWe show how the correspondence between inverse semigroups and inductive groupoids (a class o...
A generalised D-semigroup is here defined to be a left E-semiabundant semigroup S in which the \over...
This thesis originated in an effort to find an efficient algorithm for the construction of finite in...