An algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2

Giancarlo Rinaldo

Abstract


We give an algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2 and establish connections with minimal vertex covers of a simple graph. We also describe an implementation in C++ of the algorithm.

Full Text:



[DOI: 10.1478/C1A0902004] About DOI

Url Resolver: : http://dx.doi.org/10.1478/C1A0902004


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.