2000 character limit reached
r-clean rings
Published 12 Apr 2011 in math.RA | (1104.2167v2)
Abstract: An element of a ring R is called clean if it is the sum of an idempotent and a unit. A ring R is called clean if each of its element is clean. An element r \in R called regular if r = ryr for some y \in R. The ring R is regular if each of its element is regular. In this paper we define a ring is r-clean if each of its elements is the sum of a regular and an idempotent element. We give some relations between r-clean and clean rings. Finally we investigate some properties of r-clean rings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.