Search

Let τ be a finite type hereditary torsion theory on the category of all modules over a commutative ring. The purpose of this paper is to give two applications of Nagata rings and modules in the sense of Jara [Nagata rings, Front. Math. China10 (2015) 91–110]. First they are used to obtain Chase's Theorem for τ -coherent rings. In particular, we obtain the w -version of Chase's Theorem, where w is the classical star operation in ideal theory. In the second half, we apply they to characterize τ -flatness in the sense of Van Oystaeyen and Verschoren [Relative Invariants of Rings-The Commutative Theory, Monographs and Textbooks in Pure and Applied Mathematics, Vol. 79 (Marcel Dekker, Inc., New York, 1983)]. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to establish a real Nullstellensatz, a Positivstellensatz and a Nichtnegativstellensatz for matrices over a commutative ring. The Stellensätze in this paper may be regarded as certain generalizations of the abstract Stellensätze for commutative rings. [ABSTRACT FROM AUTHOR]

If {Ri}i ∈ I is a family of rings, then it is well-known that Q(Ri) = Q(Q(Ri)) and Q(∏i∈I Ri) = ∏i∈I Q(Ri), where Q(R) denotes the maximal ring of quotients of R. This paper contains an investigation of how these results generalize to the rings of quotients Qα(R) defined by ideals generated by dense subsets of cardinality less than ℵα. The special case of von Neumann regular rings is studied. Furthermore, a generalization of a theorem regarding orthogonal completions is established. Illustrative example are presented. [ABSTRACT FROM AUTHOR]

The theory of linear codes over finite fields has been extended by A. Nechaev to codes over quasi-Frobenius modules over commutative rings, and by J. Wood to codes over (not necessarily commutative) finite Frobenius rings. In the present paper, we subsume these results by studying linear codes over quasi-Frobenius and Frobenius modules over any finite ring. Using the character module of the ring as alphabet, we show that fundamental results like MacWilliams' theorems on weight enumerators and code isometry can be obtained in this general setting. [ABSTRACT FROM AUTHOR]