scispace - formally typeset
Search or ask a question
Topic

Cancellative semigroup

About: Cancellative semigroup is a research topic. Over the lifetime, 1320 publications have been published within this topic receiving 13319 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, it was shown that the semigroup of quotients Q = Q(S) corresponding to the filter of dense right ideals of a semigroup S is also a semilattice of groups.

6 citations

Journal ArticleDOI
TL;DR: In this article, a topological inverse semigroup from a semilattice is constructed, where the real numbers are obtained by starting with real numbers as a semi-attice with the operation a.............. ∨ b=sup{a,b}.
Abstract: In this paper we study dense inverse subsemigroups of topological inverse semigroups. We construct a topological inverse semigroup from a semilattice. Finally, we give two examples of the closure of B ( −∞, ∞ ) 1 , a topological inverse semigroup obtained by starting with the real numbers as a semilattice with the operation a ∨ b=sup{a,b}.

6 citations

Journal ArticleDOI
01 Jan 1990
TL;DR: In this paper, it was shown that a regular semigroup S C 9 (F) has the permutation property 37, m > 2, if for every a,..., am E S, there exists a non-trivial permutation a such that al a = a,()... aU(,nf).
Abstract: It is well-known that if a semigroup algebra K[S] over a field K satisfies a polynomial identity then the semigroup S has the permutation property. The converse is not true in general even when S is a group. In this paper we consider linear semigroups S C 9 (F) having the permutation property. We show then that K[S] has a polynomial identity of degree bounded by a fixed function of n and the number of irreducible components of the Zariski closure of S. A semigroup S is said to have the property 37, m > 2, if for every a,, .. ., am E S, there exists a non-trivial permutation a such that al a = a,()... aU(,nf). S has the permutation property 37 if S satisfies 3Y for some m> 2. The class of groups of this type was shown in [3] to consist exactly of the finite-by-abelian-by-finite groups. For the recent results and references on this extensively studied class of groups, we refer to [1]. The above description of groups satisfying 37 was extended to cancellative semigroups in [11], while a study of regular semigroups with this property was begun in [6]. In connection with the corresponding semigroup algebras K[S] over a field K, the problem of the relation between the property 37 for S and the Plproperty for K[S] attracted the attention of several authors. It is straightforward that S has 37 whenever K[S] satisfies a polynomial identity. However the converse fails even for groups in view of [3] and the characterization of PI group algebras, cf. [1 5]. On the other hand, K[S] was shown to be a PI-algebra whenever S is a finitely generated semigroup (satisfying 3 ) of one of the following types: periodic [20], cancellative [11], 0-simple [3, 5], inverse, or a Rees factor semigroup of free semigroup, cf. [12]. However, a finitely generated regular semigroup S with two non-zero OF-classes having Y but with K[S] not being PI was constructed in [12]. The main result of this paper is that if S is a linear semigroup satisfying 39, then K[S] is PI for any field K. In the course of the proof, we obtain a structural description of a strongly 7r-regular semigroup of this type. The basic technique is to consider the Zariski closure S of S. Then S is a linear Received by the editors July 7, 1989. 1980 Mathematics Subject Classification (1985 Revision). Primary 20M25, 16A38; Secondary 20M20, 16A45. ? 1990 American Mathematical Society 0002-9939/90 $1.00 + $.25 per page

6 citations

Journal ArticleDOI
TL;DR: The structure of the flow monoid of a regular semigroup is studied, which is a category in which every morphism is invertible and determined in terms of the Green relations on the original semigroup.
Abstract: We study the structure of the flow monoid of a regular semigroup. This arises from the approach of Nambooripad of considering a regular semigroup as a groupoid – a category in which every morphism is invertible. A flow is then a section to the source map in this groupoid, and the monoid structure of the set of all flows is determined in terms of the Green relations on the original semigroup.

6 citations


Network Information
Related Topics (5)
Semigroup
16.4K papers, 250.1K citations
82% related
Lp space
8.7K papers, 212.4K citations
78% related
Automorphism
15.5K papers, 190.6K citations
78% related
Banach space
29.6K papers, 480.1K citations
77% related
Interpolation space
8.1K papers, 243.3K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202224
20216
20206
20193
201810