2006
DOI: 10.1080/00927870600651695
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian Polynomials and Content Ideal in Pullbacks

Abstract: This article deals mainly with rings (with zerodivisors) in which regular Gaussian polynomials have locally principal contents. Precisely, we show that if T M is a local ring which is not a field, D is a subring of T/M such that qf D = T/M, h T → T/Mis the canonical surjection and R = h −1 D , then if T satisfies the property "every regular Gaussian polynomial has locally principal content," then also R verifies the same property. We also show that if D is a Prüfer domain and T satisfies the property "every Ga… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
3
1

Relationship

4
0

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…3) If R 1 ×R 2 is an arithmetical ring, then, for each i = 1, 2, R i is an arithmetical ring as homomorphic image of an arithmetical ring by Theorem 3.1 (2).…”
Section: Homomorphic Image Of Prüfer Conditionsmentioning
confidence: 99%
“…3) If R 1 ×R 2 is an arithmetical ring, then, for each i = 1, 2, R i is an arithmetical ring as homomorphic image of an arithmetical ring by Theorem 3.1 (2).…”
Section: Homomorphic Image Of Prüfer Conditionsmentioning
confidence: 99%
“…(1) The homomorphic image of a Gaussian ring is Gaussian. (2) The homomorphic image of an arithmetical ring is arithmetical.…”
Section: Homomorphic Image Of Prüfer Conditionsmentioning
confidence: 99%
“…(1) R is semihereditary, i.e., every finitely generated ideal of R is projective. (2) The weak global dimension of R is at most one.…”
Section: Introductionmentioning
confidence: 99%
“…And a domain is Gaussian if and only if it is a Prüfer domain. See for instance [1], [5], [9], [11]. b i X i ∈ R[X] satisfy f g = 0, we have C(f )C(g) = 0 (that is a i b j = 0 for every i and j).…”
Section: Introductionmentioning
confidence: 99%