Abstract
In this paper I present an algorithm for computing the primary decomposition of a submodule of a free module of a polynomial ring in two variables over a field k. Based on Lazard's (1985) algorithm for primary decomposition of ideals in two variables over a field, this algorithm is more explicit than those known for more general cases.
Sign-in/Register to access full text options 
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.
