English

An Algorithm to Compute a Primary Decomposition of Modules in Polynomial Rings over the Integers

Commutative Algebra 2014-08-20 v1

Abstract

We present an algorithm to compute the primary decomposition of a submodule N\mathcal{N} of the free module Z[x1,,xn]m\Z[x_1, \ldots, x_n]^m. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the integers. The idea is to compute first the minimal associated primes of N\mathcal{N}, i.e. the minimal associated primes of the ideal \Ann(Z[x1,,xn]m/N)\Ann(\Z[x_1, \ldots, x_n]^m /\mathcal{N}) in Z[x1,,xn]\Z[x_1,\ldots,x_n] and then compute the primary components using pseudo-primary decomposition and extraction, following the ideas of Shimoyama-Yokoyama. The algorithms are implemented in {\sc Singular}.

Keywords

Cite

@article{arxiv.1408.4343,
  title  = {An Algorithm to Compute a Primary Decomposition of Modules in Polynomial Rings over the Integers},
  author = {Nazeran Idrees and Gerhard Pfister and Afshan Sadiq},
  journal= {arXiv preprint arXiv:1408.4343},
  year   = {2014}
}

Comments

10 pages