The category of affine algebraic regular monoids

<abstract><p>The main aim of this study is to characterize affine weak $ k $-algebra $ H $ whose affine $ k $-variety $ S = M_{k}(H, k) $ admits a regular monoid structure. As preparation, we determine some results of weak Hopf algebras morphisms, and prove that the anti-function from the category $ \mathcal{C} $ of weak Hopf algebras whose weak antipodes are anti-algebra morphisms is adjoint. Then, we prove the main result of this study: the anti-equivalence between the category of affine algebraic $ k $-regular monoids and the category of finitely generated commutative reduced weak $ k $-Hopf algebras.</p></abstract>

Construction of Inverse Unit Regular Monoids from a Semilattice and a Group

This paper is a continuation of a previous paper [6] in which the structure of certain unit regular semigroups called R-strongly unit regular monoids has been studied. A monoid S is said to be unit regular if for each element s Î S there exists an element u in the group of units G of S such that s = sus. Hence where su is an idempotent and is a unit. A unit regular monoid S is said to be a unit regular inverse monoid if the set of idempotents of S form a semilattice. Since inverse monoids are R unipotent, every element of a unit regular inverse monoid can be written as s = eu where the idempotent part e is unique and u is a unit. Here we give a detailed study of inverse unit regular monoids and the results are mainly based on [10]. The relations between the semilattice of idempotents and the group of units in unit regular inverse monoids are better identified in this case. .

Natural Partial Orders on Transformation Semigroups with Fixed Sets

LetXbe a nonempty set. For a fixed subsetYofX, letFixX,Ybe the set of all self-maps onXwhich fix all elements inY. ThenFixX,Yis a regular monoid under the composition of maps. In this paper, we characterize the natural partial order onFix(X,Y)and this result extends the result due to Kowol and Mitsch. Further, we find elements which are compatible and describe minimal and maximal elements.

CONSTRUCTION OF A R-STRONGLY UNIT REGULAR MONOID FROM A REGULAR BIORDERED SET AND A GROUP

In this paper we give a detailed study of R-strongly unit regular monoids. The relations between the biordered set of idempotents and the group of units in unit regular semigroups are better identified here. Conversely, starting from a regular biordered set E and a group G we construct a R-strongly unit regular semigroup S for which the set of idempotents E(S) is isomorphic to E as a biordered set and the group of units G(S) is isomorphic to G. The conditions to be satisfied by G and E are also listed.

CODING PARTITIONS OF REGULAR SETS

A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many regular monoids.

Unit regular monoids

We derive necessary and sufficient conditions for a unit regular monoid to have a uniquely unit regular, idempotent separating cover.

Direct finiteness of certain monoid algebras

A semigroup is said to be completely regular if and only if each of its elements lies in a subgroup. It is shown that the algebra of a completely regular monoid (semigroup with identity) over a field of characteristic zero is directly finite.

Associate subgroups of orthodox semigroups

A unit regular semigroup [1, 4] is a regular monoid S such that H1 ∩ A(x) ≠ Ø for every xɛS, where H1, is the group of units and A(x) = {y ɛ S; xyx = x} is the set of associates (or pre-inverses) of x. A uniquely unit regular semigroupis a regular monoid 5 such that |H1 ∩ A(x)| = 1. Here we shall consider a more general situation. Specifically, we consider a regular semigroup S and a subsemigroup T with the property that |T ∩ A(x) = 1 for every x ɛ S. We show that T is necessarily a maximal subgroup Hα for some idempotent α. When Sis orthodox, α is necessarily medial (in the sense that x = xαx for every x ɛ 〈E〉) and αSα is uniquely unit orthodox. When S is orthodox and α is a middle unit (in the sense that xαy = xy for all x, y ɛ S), we obtain a structure theorem which generalises the description given in [2] for uniquely unit orthodox semigroups in terms of a semi-direct product of a band with a identity and a group.

INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES

We verify the "Type II Conjecture" concerning the question of which elements of a finite monoid M are related to the identity in every relational morphism with a finite group. We confirm that these elements form the smallest submonoid, K, of M (containing 1 and) closed under "weak conjugation", that is, if x ∈ K, y ∈ M, z ∈ M and yzy = y then yxz ∈ K and zxy ∈ K. More generally, we establish a similar characterization of those directed graphs having edges are labelled with elements of M which have the property that for every such relational morphism there is a choice of related group elements making the corresponding labelled graph "commute". We call these "inevitdbleM-graph". We establish, using this characterization, an effective procedure for deciding from the multiplication table for M whether an "M-graph" is inevitable. A significant stepping–stone towards this was Tilson's 1986 construction which established the Type II Conjecture for regular monoid elements, and this construction is used here in a slightly modified form. But substantial credit should also be given to Henckell, Margolis, Meakin and Rhodes, whose recent independent work follows lines very similar to our own.