Abstract
Let K be an infinite perfect computable field and let I⊆K [ x ] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice, the algorithm generally works in finite fields of large characteristic as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
