Computing Intersections, Dual and Divisorial Closure of Ideals in A Class of Rings
Keywords:
Dual of ideals, v-closure, GCD domains.Abstract
Let D be an integral domain, X an indeterminate over D and let n be a positive integer. The set {a0 + a1Xn + a2X3 + ... anXn|ai ∈ D} is a subrings of D[X] denoted by D+XnD[X]. This class of subrings is studied in [1] for n = 2. In this article we find explicit formulas to compute finite intersections, dual and divisorial closure of monomial ideals of D + XnD[X].
Key words and phrases. Dual of ideals, v-closure, GCD domains.
1991 Mathematics Subject Classification. 13A15, 13F05
Downloads
Published
2025-05-18
How to Cite
S. U. Rehman, & N. Siddique. (2025). Computing Intersections, Dual and Divisorial Closure of Ideals in A Class of Rings. Jordan Journal of Mathematics and Statistics, 10(4), 297–306. Retrieved from https://jjms.yu.edu.jo/index.php/jjms/article/view/987
Issue
Section
Articles