Related papers: On inverse and right inverse ordered semigroups

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

A groupoid satisfying the left invertive law: $ab\cdot c=cb\cdot a$ is called an AG-groupoid and is a generalization of commutative semigroups. We consider the concept of bi-commutativity in AG-groupoids and thus introduce left commutative…

In this article, we concurrently explore the class of m-bi-ideals as well as the class of m- interior ideals in an ordered semigroup. We call these class of ideals as m-bi-interior ideals. Here, m-simple, m-regular ordered semigroups and…

This is an account of the theory of inverse semigroups, assuming only that the reader knows the basics of semigroup theory.

In this paper, we introduce notions called inverse set and inverse correspondence over inverse semigroups. These are analogies of Hilbert $C^*$-modules and \Ccorrs in the $C^*$-algebra theory. We show that inverse semigroups and inverse…

Let $A\subseteq B$ be a $C^*$-inclusion. We give efficient conditions under which $A$ separates ideals in $B$, and $B$ is purely infinite if every positive element in $A$ is properly infinite in $B$. We specialise to the case when $B$ is a…

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…

In this paper we describe all those ordered semigroups which are the nil extension of Clifford, left Clifford, group like, left group like ordered semigroups.

The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…

Using the recent notion of inverse along an element in a semigroup, and the natural partial order on idempotents, we study bicommuting generalized inverses and define a new inverse called natural inverse, that generalizes the Drazin inverse…

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

We prove that if $S$ is a $le$-semigroup in which left ideal elements commute (condition which is called $\mathbf{\Lambda}$), then any $\mathcal{J}$-class satisfying the Green condition is a subsemigroup of $S$. As a corollary of this we…

We investigate ternary products of groupoids and prove that there is a one-to-one correspondence between the collection of right modular groupoids with a left identity element l and laterally commutative, l-bi-unital semiheaps. This result…

Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…

In this paper, we characterize intra-regular LA-semihypergroups by using the properties of their left and right hyperideals and we investigate some useful conditions for an LA-semihypergroup to become an intra-regular LA-semihypergroup.

Every semigroup containing an ideal subgroup is called a homogroup, and it is a grouplike if and only if it has only one central idempotent. On the other hand, a class of algebraic structures covering group-$e$-semigroups…

Let $T(X)$ (resp. L(V)) be the semigroup of all transformations (resp. linear transformations) of a set $X$ (resp. vector space $V$). For a subset $Y$ of $X$ and a subsemigroup $\mathbb{S}(Y)$ of $T(Y)$, consider the subsemigroup…

In this paper we study the probability that two elements selected at random with replacement from a given finite semigroup act the same by right translation on the semigroup, that is, the chosen elements have the same right matrix.

Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…