2006Algebra ColloquiumRequires access

n-Clean Rings

Guangshi Xiao, Wenting Tong

Open publisher page 5 citations

Abstract

Let n be a positive integer. A ring R is called n-clean if every element of R can be written as a sum of an idempotent and n units in R. The class of n-clean rings contains clean rings and (S,n)-rings (i.e., every element is a sum of no more than n units). In this paper, we investigate some properties on n-clean rings. There exists a clean and (S,3)-ring which is not an (S,2)-ring. If R is a ring satisfying (SI), then the polynomial ring R[x] is not n-clean for any positive integer n. An example shows that for any positive integer n> 1, there exists a non n-clean ring R such that the 2× 2 matrix ring M2(R) over R is n-clean.

About this research paper

What this paper is about

Let n be a positive integer. A ring R is called n-clean if every element of R can be written as a sum of an idempotent and n units in R. The class of n-clean rings contains clean rings and (S,n)-rings (i.e., every element is a sum of no more than n units). In this paper, we investigate some properties on n-clean rings. There exists a clean and (S,3)-ring which is not an (S,2)-ring. If R is a ring satisfying (SI), then the polynomial ring R[x] is not n-clean for any positive integer n. An example shows that for any positive integer n> 1, there exists a non n-clean ring R such that the 2× 2 matrix ring M2(R) over R is n-clean.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let n be a positive integer. A ring R is called n-clean if every element of R can be written as a sum of an idempotent and n units in R. The class of n-clean rings contains clean rings and (S,n)-rings (i.e., every element is a sum of no more than n units). In this paper, we investigate some properties on n-clean rings. There exists a clean and (S,3)-ring which is not an (S,2)-ring. If R is a ring satisfying (SI), then the polynomial ring R[x] is not n-clean for any positive integer n. An example shows that for any positive integer n> 1, there exists a non n-clean ring R such that the 2× 2 matrix ring M2(R) over R is n-clean.

Key concepts: Idempotence, Mathematics, Matrix ring, Integer (computer science), Ring (chemistry), Polynomial ring, Primitive ring, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
n-Clean Rings — Research Paper | ScholarLens