Details:
Title  An algorithm for primary decomposition in polynomial rings over the integers.  Author(s)  Gerhard Pfister, Afshan Sadiq, Stefan Steidel  Type  Article in Journal  Abstract  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 ShimoyamaYokoyama, resp. EisenbudHuneckeVasconcelos, to extract primary ideals from pseudoprimary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.  Keywords  Gröbner bases, Primary decomposition, Modular computation, Parallel computation  ISSN  18951074; 16443616/e 
URL 
http://link.springer.com/article/10.2478%2Fs1153301100378 
Language  English  Journal  Cent. Eur. J. Math.  Volume  9  Number  4  Pages  897904  Publisher  Springer, Heidelberg; De Gruyter Open, Warsaw  Year  2011  Edition  0  Translation 
No  Refereed 
No 
