Let R be an associative ring with identity, C(R) denote the center of R, and g(x) be a polynomial in the polynomial ring C(R)[x]. R is called strongly g(x)-clean if every element r ∈ R can be written as r = s+u with g(s) = 0, u a unit of R, and su = us. The relation between strongly g(x)-clean rings and strongly clean rings is determined, some general properties of strongly g(x)-clean rings are...

A ring R is said to be n-clean if every element can be written as a sum of an idempotent and n units. The class of these rings contains clean ring and n-good rings in which each element is a sum of n units. In this paper, we show that for any ring R, the endomorphism ring of a free R-module of rank at least 2 is 2-clean and that the ring B(R) of all ω × ω row and column-finite matrices over any...

We introduce the notion of clean ideal, which is a natural generalization of clean rings. It is shown that every matrix ideal over a clean ideal of a ring is clean. Also we prove that every ideal having stable range one of a regular ring is clean. These generalize the corresponding results for clean rings. 1. Introduction. Let R be a unital ring. We say that R is a clean ring in case every elem...

The real Jacobi group $G^J_n(\mathbb{R})$, defined as the semidirect product of Heisenberg ${\rm H}_n(\R)$ with symplectic ${\mr {Sp}}(n,\mathbb{R})$, admits a matrix embedding in $\text{Sp}(n+1,\mathbb{R})$. modified pre-Iwasawa decomposition $\rm{Sp}(n,\mathbb{R})$ allows us to introduce convenient coordinatization $S_n$ which for $G^J_1(\mathbb{R})$ coincides $S$-coordinates. Invariant one-f...

Let R be an associative ring with unity. An element a in R is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von Neumann) element in R. If every element of R is r-clean, then R is called an r-clean ring. In this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. Further we prove that if 0 and 1 are the only idempotents...

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

An ideal I of a ring R is called right Baer-ideal if there exists an idempotent e 2 R such that r(I) = eR. We know that R is quasi-Baer if every ideal of R is a right Baer-ideal, R is n-generalized right quasi-Baer if for each I E R the ideal In is right Baer-ideal, and R is right principaly quasi-Baer if every principal right ideal of R is a right Baer-ideal. Therefore the concept of Baer idea...