On the Construction of Gr\"obner Bases with Coefficients in Quotient Rings
Huishi Li

TL;DR
This paper demonstrates how to construct Gröbner bases over quotient rings by leveraging Gröbner bases in polynomial rings over Noetherian rings, enabling practical computation in these algebraic structures.
Contribution
It establishes that Gröbner bases in quotient polynomial rings can be effectively constructed via Gröbner bases in polynomial rings over Noetherian rings, broadening computational methods.
Findings
Linear equations are solvable in quotient rings if solvable in the base ring.
Gröbner bases in quotient rings can be obtained from those in polynomial rings over the base ring.
Applications include polynomial rings over PIDs and fields, demonstrating practical utility.
Abstract
Let be a commutative Noetherian ring, and let be a proper ideal of , . Consider the polynomial rings and . Suppose that linear equations are solvable in . It is shown that linear equations are solvable in (thereby theoretically Gr\"obner bases for ideals of are well defined and constructible) and that practically Gr\"obner bases in with respect to any given monomial ordering can be obtained by constructing Gr\"obner bases in , and moreover, all basic applications of a Gr\"obner basis at the level of can be realized by a Gr\"obner basis at the level of . Typical applications of this result are demonstrated respectively in the cases where is a PID, is a polynomial ring over a PID , and is a polynomial ring over a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Cryptography and Residue Arithmetic
