The adcending chain condition for real ideas.
Different properties of rings and fields are discussed [12], [41] and [17]. We introduce ring homomorphisms, their kernels and images, and prove the First Isomorphism Theorem, namely that for a homomorphism f : R → S we have R/ker(f) ≅ Im(f). Then we define prime and irreducible elements and show that every principal ideal domain is factorial. Finally we show that polynomial rings over fields are Euclidean and hence also factorial
In 1950 in volume 1 of Proc. Amer. Math. Soc., B. Brown and N. McCoy showed that every (not necessarily commutative) ring has an ideal consisting of elements for which there is an such that , and maximal with respect to this property. Considering only the case when is commutative and has an identity element, it is often not easy to determine when is not just the zero ideal. We determine when this happens in a number of cases: Namely when at least one of or has a von Neumann inverse,...
Let be a finite simple graph with the vertex set and let be its edge ideal in the polynomial ring . We compute the depth and the Castelnuovo-Mumford regularity of when or is a graph obtained from Cohen-Macaulay bipartite graphs , by the operation or operation, respectively.
Let be a commutative ring with unity and be the set of unit elements of . In this paper, we introduce and investigate some properties of a new kind of graph on the ring , namely, the prime ideals intersection graph of , denoted by . The is a graph with vertex set and two distinct vertices and are adjacent if and only if there exists a prime ideal of such that . We obtain necessary and sufficient conditions on such that is disconnected. We find the diameter and girth of ....