On the structure of linear semigroups

Green's Lemma [1, Lemma 2.2] is one of the most important theorems in the theory of semigroups. The main purpose of this note is to establish a generalized Green's Lemma and a generalized Clifford and Miller's Theorem [1, p. 59] in linear semigroups. A generalized Green's Lemma describes the behavior of certain mappings between two distinct D-classes.     

On semigroups admitting ring structure

A multiplicative semigroup S with 0 is said to be a R-semigroup if S admits a ring structure. Isbell proved that if a finitely generated commutative semigroup is a R-semigroup, then it should be finite. The non-commutative version of this theorem is unsettled. This paper considers semigroups, not necessarily commutative, which are principally generated as a right ideal by single elements and semigroups which are generated by two independent generators and describes their structure. We also prove that if a cancellative 0-simple semigroup containing an identity is a R-semigroup, then it should be a group with zero. Communicated by A. H. Clifford     

On semigroups admitting ring structure

A right-chain semigroup is a semigroup whose right ideals are totally ordered by set inclusion. The main result of this paper says that if S is a right-chain semigroup admitting a ring structure, then either S is a null semigroup with two elements or sS=S for some s∈S. Using this we give an elementary proof of Oman’s characterization of semigroups admitting a ring structure whose subsemigroups (containing zero) form a chain. We also apply this result, along with two other results proved in this paper, to show that no nontrivial multiplicative bounded interval semigroup on the real line ℝ admits a ring structure, obtaining the main results of Kemprasit et al. (ScienceAsia 36: 85–88, 2010).     

On semigroups admitting ring structure

The set of elements of an (associative) ring under multiplication form a semigroup, but not every semigroup is isomorphic to the multiplicative structure of a ring. The class of all multiplicative semigroups of all rings can not be described axiomatically. Nevertheless for unique-addition rings, for finite rings and other special cases interesting characterizations can be given. An abbreviated version was presented at the Symposium on Semigroups and the Multiplicative Structure of Rings held at the University of Puerto Rico-Mayaguez, March 9–13, 1970.     

On the structure of semigroups of idempotent matrices

We prove that any pure regular band of matrices admits a simultaneous LU decomposition in the standard form. In case that such a band forms a double band called a skew lattice, we obtain the standard form without the assumption of purity.     

On semigroups admitting ring structure II

We shall consider semigroups with O, which contain a unique maximal right ideal generated by a finite number of independent generators and in which every proper right ideal is contained in the unique maximal right ideal and investigate when these semigroups are multiplicative semigroups of a ring. We prove in particular that the necessary condition for this class of semigroups S to admit ring structure is S=S² if |S|>2. Furthermore the admissible ring structure of S is determined when the product of every two generators of the maximal right ideal M is O and when S satisfies one of the two conditions, namely S is commutative without idempotents except O and 1 or every generator of M is nilpotent.     

The structure ofP-regular semigroups

This paper gives some equivalent definitions of stronglyP-regular semigroups and characterizes the structure ofP-regular semigroups as the spined product of fundamentalP-regular semigroups and regular *-semigroups. This work is supported by the National Nature Science Foundation of China.     

Characters and the structure of finite semigroups

It is shown that properties of the structure of a finite semigroup S such as the order of the set ofJ of S and the existence of normal subsemigroups may be deduced from the knowledge of the characters of the irreducible representations of S. The character table of the full transformation semigroup T₄ of a four-element set is given.     

Computing the ideal structure of finite semigroups

In this paper algorithms are described for computing the equivalence classes induced by the Green relations on the elements of a finite semigroup.     

The structure of superabundant semigroups

A structure theorem for superabundant semigroups in terms of semilattices of normalized Rees matrix semigroups over some cancellative monoids is obtained. This result not only provides a construction method for superabundant semigroups but also generalizes the well-known result of Petrich on completely regular semigroups. Some results obtained by Fountain on abundant semigroups are also extended and strengthened.