Idempotent elements and uniquely clean property of skew monoid rings

2018 ◽  
Vol 55 (1) ◽  
pp. 23-40
Author(s):  
Arezou Karimi Mansoub ◽  
Ahmad Moussavi
Keyword(s):  

Let R be a ring with an endomorphism σ and F ∪ {0} the free monoid generated by U = {u1, ..., ut} with 0 added, and M = F ∪ {0}/(I) where I is the set of certain monomial in U such that Mn = 0, for some n. Then we can form the non-semiprime skew monoid ring R[M; σ]. An element a ∈ R is uniquely strongly clean if a has a unique expression as a = e + u, where e is an idempotent and u is a unit with ea = ae. We show that a σ-compatible ring R is uniquely clean if and only if R[M; σ] is a uniquely clean ring. If R is strongly π-regular and uniquely strongly clean, then R[M; σ] is uniquely strongly clean. It is also shown that idempotents of R[M; σ] (and hence the ring R[x; σ]=(xn)) are conjugate to idempotents of R and we apply this to show that R[M; σ] over a projective-free ring R is projective-free. It is also proved that if R is semi-abelian and σ(e) = e for each idempotent e ∈ R, then R[M; σ] is a semi-abelian ring.

2003 ◽  
Vol 13 (03) ◽  
pp. 341-359 ◽  
Author(s):  
Juan M. Alonso ◽  
Susan M. Hermiller

In 1987, Squier defined the notion of finite derivation type for a finitely presented monoid. To do this, he associated a 2-complex to the presentation. The monoid then has finite derivation type if, modulo the action of the free monoid ring, the 1-dimensional homotopy of this complex is finitely generated. Cremanns and Otto showed that finite derivation type implies the homological finiteness condition left FP3, and when the monoid is a group, these two properties are equivalent. In this paper we define a new version of finite derivation type, based on homological information, together with an extension of this finite derivation type to higher dimensions, and show connections to homological type FPnfor both monoids and groups.


2000 ◽  
Vol 10 (04) ◽  
pp. 457-480 ◽  
Author(s):  
OLGA SAPIR

Let W be a finite language and let Wc be the closure of W under taking subwords. Let S(W) denote the Rees quotient of a free monoid over the ideal consisting of all words that are not in Wc. We call W finitely based if the monoid S(W) is finitely based. Although these semigroups have easy structure they behave "generically" with respect to the finite basis property [6]. In this paper, we describe all finitely based words in a two-letter alphabet. We also find some necessary and some sufficient conditions for a set of words to be finitely based.


Author(s):  
Rudolf Pietschnig ◽  
Fabian Roesler ◽  
Máté Kovács ◽  
Clemens Bruhn ◽  
Zsolt Kelemen

Author(s):  
Fabian Roesler ◽  
Máté Kovács ◽  
Clemens Bruhn ◽  
Zsolt Kelemen ◽  
Rudolf Pietschnig

2019 ◽  
Vol 578 ◽  
pp. 83-88 ◽  
Author(s):  
Atsufumi Kinoshita ◽  
Kousuke Nakanishi ◽  
Ryosuke Yagi ◽  
Atsuhiro Tanaka ◽  
Keiji Hashimoto ◽  
...  
Keyword(s):  

1977 ◽  
Vol 34 (2) ◽  
pp. 123-129 ◽  
Author(s):  
H.J. Shyr
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document