Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

An algorithm for primary decomposition in polynomial rings over the integers

Gerhard PfisterAfshan SadiqStefan Steidel — 2011

Open Mathematics

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.

Page 1

Download Results (CSV)