Journal of Symbolic Computation
Algebraic numbers: an example of dynamic evaluation
Journal of Symbolic Computation
A new algorithm for discussing Gröbner bases with parameters
Journal of Symbolic Computation
An alternative approach to comprehensive Gröbner bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
A speed-up of the algorithm for computing comprehensive Gröbner systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Stability of parametric decomposition
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Hi-index | 0.00 |
For a given polynomial f and an ideal I of a polynomial ring K[X] over a field K, we give a necessary and sufficient condition for I to have a smallest ideal extension J such that f is invertible in the residue class ring K[X]/J. If the condition holds, J is shown to be the saturation ideal I:∞. We also show primary decompositions of the ideals I:∞ and I+9fm;:, where m is a natural number such that I:∞ = I:fm, all together forms a primary decomposition of I with no modification. These observations are especially useful for polynomial rings with parameters.