An algorithm for primary decomposition in polynomial rings over the integers

Details An algorithm for primary decomposition in polynomial rings over the integers An algorithm for primary decomposition in polynomial rings over the integers

2010-08-12

arxiv.org/abs/1008.2074v3

Central European Journal of Mathematics 9(4), 897-904 (2011)

Mathematics

Commutative Algebra

8 pages

Scientific paper

10.2478/s11533-011-0037-8

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.

Affiliated with

Also associated with

No associations

Rating

An algorithm for primary decomposition in polynomial rings over the integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithm for primary decomposition in polynomial rings over the integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for primary decomposition in polynomial rings over the integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-586692