Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleAn algorithm for primary decomposition in polynomial rings over the integers.
Author(s) Gerhard Pfister, Afshan Sadiq, Stefan Steidel
TypeArticle in Journal
AbstractWe 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.
KeywordsGröbner bases, Primary decomposition, Modular computation, Parallel computation
ISSN1895-1074; 1644-3616/e
URL http://link.springer.com/article/10.2478%2Fs11533-011-0037-8
LanguageEnglish
JournalCent. Eur. J. Math.
Volume9
Number4
Pages897--904
PublisherSpringer, Heidelberg; De Gruyter Open, Warsaw
Year2011
Edition0
Translation No
Refereed No
Webmaster