LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Subexponential-Time Computation of Isolated Primary Components of a Polynomial Ideal

Photo by jontyson from unsplash

We suggest an algorithm for constructing all the isolated primary components of a given polynomial ideal. At the output, they are determined by systems of generators up to embedded components,… Click to show full abstract

We suggest an algorithm for constructing all the isolated primary components of a given polynomial ideal. At the output, they are determined by systems of generators up to embedded components, and also as kernels of some homomorphisms. The complexity of this algorithm is subexponential in the size of the input data.

Keywords: isolated primary; computation isolated; subexponential time; time computation; polynomial ideal; primary components

Journal Title: Journal of Mathematical Sciences
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.